41. Process Algebra: Open Problems And Future Directions Process Algebra open problems and Future Directions July 2125, 2003University of Bologna Residential Center Bertinoro (Forlì), Italy. http://www.cs.auc.dk/~luca/BICI/pa2003.html

Process Algebra: Open Problems and Future Directions July 21-25, 2003 University of Bologna Residential Center Bertinoro Forlì ), Italy What the Meeting is About Seminar Schedule Output of the Workshop Location ... Local Weather Forecast What the Meeting is About Process algebra (also known under the names `process calculi' or `process theory') is a successful method for reasoning about concurrent systems that originates from original insights of key figures like Bergstra, Hoare, Klop and Milner. The foundations of process algebra have been studied thoroughly over the last twenty years, and are still leading to large numbers of interesting results and fruitful ideas. In recent years, powerful tool sets for the analysis of concurrent systems, such as Caesar/Aldebaran, muCRL, Concurrency Factory, FDR, FC2Tools and Concurrency Workbench Edinburgh, have been developed on the basis of process algebra. A wide range of advanced protocols and distributed algorithms have been verified using process algebraic methods, and/or analyzed using the aforementioned tool sets. The aim of this workshop will be to highlight the most important open problems in the field of process algebra, and to stimulate international cooperation on their solutions. Special emphasis will also be given to future directions in the study of process algebra, and to new application areas.

42. The Valuation Theory Home Page A forum for all mathematicians who work in or use valuation theory. Directory of people, meetings, preprints, bibliography, open problems and news. http://math.usask.ca/fvk/Valth.html

Welcome, dear reader, to The Valuation Theory Home Page This home page is intended to be a forum for all mathematicians who work in valuation theory or apply valuation theoretical results in their own field of research. The home page offers: postscript- or dvi-files of recent papers, books and theses in valuation theory information about conferences and special events, names and email addresses of mathematicians working in or with valuation theory, and, if possible, links to their home pages a comprehensive bibliography as Bibtex-, dvi- and postscript file, which presently contains 770 entries, a page for open problems and, hopefully, their solutions, interesting NEWS in connection with valuation theory, some useful links a page for historical information and related questions, a page for errors, pitfalls and the nicest proofs in valuation theory (to come). If you have suggestions, questions, ideas, news, or if you want your name and address on the above mentioned list, or if you have a recent paper in or applying valuation theory, then write to valth [at] math.usask.ca

43. Process Algebra: Open Problems And Future Directions Process Algebra open problems and Future Directions July 2125, 2003 Forlì),Italy. Some open problems in Process Algebra. This web http://www.cs.auc.dk/~luca/BICI/open-problems.html

Process Algebra: Open Problems and Future Directions July 21-25, 2003 University of Bologna Residential Center Bertinoro Forlì ), Italy Some Open Problems in Process Algebra This web page lists some open problems in process algebra communicated, at least initially, by the participants at the workshop Process Algebra: Open Problems and Future Directions We intend to maintain this page as up to date as possible, in the hope that it will be a useful resource for the practising process algebraist and concurrency theorist. To this end, we invite all of the members of the process algebra community to help us by sending the maintainer of this page suggestions for new problems to be posted here, and pointers to their solutions. Some further open problems are mentioned in the note Some of My Favourite Results in Classic Process Algebra by Luca Aceto , and on the slides of the talks delivered at the workshop. Problems Posted by Luca Aceto Does bisimulation equivalence admit a finite equational axiomatization over the language obtained by adding Hennessy's auxiliary operator from to CCS?

44. OPEN PROBLEMS IN TOPOLOGY PDF 4 MB open problems IN TOPOLOGY PDF 4 MB . Table of Contents. Introduction PDF 0.1 MB , v. by G. Gruenhage, 85. open problems on ß? PDF 0.4 MB . http://www.elsevier.com/homepage/sac/opit/toc.htm

OPEN PROBLEMS IN TOPOLOGY Table of Contents Introduction v I Set Theoretic Topology Dow's Questions by A. Dow Steprans’ Problems by J. Steprans Tall’s Problems by F. D. Tall Problems I wish I could solve by S. Watson Weiss’ Questions by W. Weiss Perfectly normal compacta, cosmic spaces, and some partition problems by G. Gruenhage by K. P. Hart and J. van Mill On first countable, countably compact spaces III: The problem of obtaining separable noncompact examples by P. Nyikos Set-theoretic problems in Moore spaces by G. M. Reed Some Conjectures by M. E. Rudin Small Uncountable Cardinals and Topology by J. E. Vaughan. With an Appendix by S. Shelah II General Topology A Survey of the Class MOBI by H. R. Bennett and J. Chaber Problems on Perfect Ordered Spaces by H. R. Bennett and D. J. Lutzer The Point-Countable Base Problem by P. J. Collins, G. M. Reed and A. W. Roscoe Some Open Problems in Densely Homogeneous Spaces by B. Fitzpatrick, Jr. and Zhou Hao-xuan Large Homogeneous Compact Spaces by K. Kunen

45. Open Problems On Graph Minors By Nathaniel Dean. http://dimacs.rutgers.edu/~nate/publics/open.ps

46. NIPS 2001 Workshop On Feature Selection Our workshop will be a forum to freely discuss negative results and introduce thecommunity to challenging open problems. 500 pm Discussion open problems. http://www.clopinet.com/isabelle/Projects/NIPS2002/

December 13 and 14, 2002 Delta Whistler Resort, British Columbia, CA Challenge In mathematics and theoretical computer science, exhibiting counter examples is part of the established scientific method to rule out wrong hypotheses. Yet, negative results and counter examples are seldom reported in experimental papers, although they can be very valuable. Our workshop will be a forum to freely discuss negative results and introduce the community to challenging open problems. This may include reporting: experimental results of principled algorithms that obtain poor performance compared to seemingly dumb heuristics; experimental results that falsify an existing theory; counter examples to a generally admitted conjecture; failure to find a solution to a given problem after various attempts; failure to demonstrate the advantage of a given method after various attempts. Submission Prospective participants are invited to submit one or two pages of summary. Theory, algorithm, and application contributions are welcome. We also welcome tutorials or historical presentations on negative results and counter examples that pushed the frontiers of neural network and machine learning research as well as tutorials on scientific methodology making use of negative results and counter examples. In preparing your submission, please remember that reporting negative results and counter examples does not mean reporting

47. OpenProblems Compiled by Jorge Urrutia, University of Ottawa. http://www.csi.uottawa.ca/~jorge/openprob/

Open Problems on Discrete and Computational Geometry. Introduction: This web page contains a list of open problems in Discrete and Computational Geometry . Contributions to the list are invited. To contribute problems, submit them to me by e-mail, in html format. For each problem you pose, you may include one or two figures, in gif or jpg format. Make sure they are not too big, as this slows down their downloading time considerably . If any problem posed here is solved, I would appreciate it if you send me an e-mail to jorge@csi.uottawa.ca . In each problem you pose, include, to the best of your knowledge, who posed the problem first, and relevant references. Try to be short, concise and to the point. This will make your problems more attractive, and may increase the chances someone will read and try to solve them. If you detect inaccuracies regarding references, etc. in the problems posed here, please let me know so that I can correct them. At least until the end of this year, the format of this page will be evolving, until a satisfactory final layout is reached. Sorry for the inconveniences this may create. Jorge Urrutia , November, 1996.

48. Open Problems In Mathematical Systems And Control Theory Electronic book on open problems in Mathematical Systems and ControlTheory. Editors Vincent Blondel , University of Louvain, Belgium http://www.inma.ucl.ac.be/~blondel/op/

Electronic book on Open Problems in Mathematical Systems and Control Theory Editors: Vincent Blondel , University of Louvain, Belgium Alexander Megretski, Massachusetts Institute of Technology, USA Associated editors: Roger Brockett, Harvard University, USA Jean-Michel Coron, University of Paris (Orsay), France Miroslav Krstic, University of California (San Diego), USA Anders Rantzer, Lund Institute of Technology, Sweden Joachim Rosenthal, University of Notre-Dame, USA Eduardo Sontag, Rutgers University, USA M. Vidyasagar, Tata Consultancy Services, India Jan Willems, Katholieke Universiteit Leuven, Belgium Submissions: The deadline for submission has passed. See the Call for submission Content The book will contain descriptions of open problems in mathematical systems and control theory. Problems can be easy or difficult, well-known or stated for the first time, long-standing or newborn. The book will be widely publicized and is expected to attract the attention of the control community to interesting mathematical problems. All means will be taken by the editors to ensure the widest possible diffusion and promotion of the problems of the book. MTNS Problem Book After a first selection round some of the problem have been selected for presentation at the Symposium MTNS 2002. A booklet with descriptions of all problem presented at MTNS 2002 is available (about 150 pages):

49. Uni Dortmund, Informatik 2: BDD-Book Solutions By Ingo Wegener (SIAM, 2000). Errata, solutions to exercises, updates on open problems. http://ls2-www.cs.uni-dortmund.de/monographs/bdd/

LS 2 Home Lehre Service Anreise Mitarbeiter Kontakt Interna Externe Links Fachbereich Informatik SFB 531 SFB 475 DFG-Schwerp. Nr. 1126 Studieninformation Branching Programs and Binary Decision Diagrams by Ingo Wegener The book is available from the Society of Industrial and Applied Mathematics. The official SIAM homepage includes an abstract and an order form. Resources PostScript PDF Last update Solutions of Exercises 2000-August-24 Solutions of Open Problems 2002-Oct-30 Errors and Misprints 2003-May-20 If you find typos etc. or if you have remarks, please contact the author. Other monographs by authors at Lehrstuhl Informatik 2.

50. Open Problems In Mathematical Systems And Control Theory open problems in Mathematical Systems and Control Theory. Vincent D.Blondel Eduardo D. Sontag M. Vidyasagar Jan C. Willems. Springer http://www.inma.ucl.ac.be/~blondel/books/openprobs/

Open Problems in Mathematical Systems and Control Theory Vincent D. Blondel Eduardo D. Sontag M. Vidyasagar Jan C. Willems Springer Verlag, London, 1999 Communication and Control Engineering Series, ISBN: 1-85233-044-9 Table of content, (partial) solutions and follow-up information This volume collects a discussion of more than fifty open problems which touch upon a variety of subfields, including: chaotic observers, nonlinear controllability, discrete event and hybrid systems, neural network learning, matrix inequalities, Lyapunov exponents, and many other issues. Proposed and explained by leading researchers, they are offered with the intention of generating further work, as well as inspiration for many other similar problems.

51. World Of Groups Part of the World Wide Algebra project. open problems in combinatorial group theory, a list of personal web pages, conferences and seminars, and useful links. http://www.grouptheory.info/

52. Problems In Graph Theory And Combinatorics" open problems Graph Theory and Combinatorics. open problems are listedalong with what is known about them, updated as time permits. http://www.math.uiuc.edu/~west/openp/

Open Problems - Graph Theory and Combinatorics collected and maintained by Douglas B. West Number of problem pages now posted: 34 This site is a resource for research in graph theory and combinatorics. Open problems are listed along with what is known about them, updated as time permits. Individual pages contain such material as title, originator, date, statement of problem, background, partial results, comments, references. Also available is a Glossary of Terms Most pages in this directory have not yet been created; so far this is mostly a list of some well-known problems for which more detailed pages will be written later. Its accessibility at this early stage is a plea for contributed material to accelerate its development. The organization of topics roughly follows the four volumes of The Art of Combinatorics under development by D.B. West. Thus the four main headings are Extremal Graph Theory Structure of Graphs Order and Optimization , and Arrangements and Methods Alternatively, below is a direct search, courtesy of Google. On this page, the search will only take you right here, but it will also find problem pages under this that contain your search term. Contributions!

53. Education Programs At DIMACS Assistance in educating K12 and undergraduate students about discreet mathematics. Lists programs and open problems in the field. http://dimacs.rutgers.edu:80/Education/

Education Programs at DIMACS: Programs for K-12 Programs for faculty: Crash Course in Discrete Mathematics DIMACS Connect Institute (DCI) DREI- DIMACS Research and Education Institute K-8 Teachers - Leadership Institutes: Exploring Discrete Mathematics in the Classroom Workshops In Your District: Exploring Discrete Mathematics New Jersey Mathematics Coalition - improving K-12 mathematics education. Programs for students: Young Scholars Program in Discrete Mathematics Undergraduate Education Programs for faculty: Reconnect Conference Reconnecting Teaching Faculty to the Mathematical Sciences Enterprise Series of Two Two-Day Workshops for Two-Year College Teachers Reconnecting Two Year College Faculty to the Mathematical Sciences Enterprise Programs for students: Open Problems for Undergraduates in discrete mathematics and theoretical computer sciences. The problems are contributed by DIMACS members and others. Research Experiences for Undergraduates Past Activities DIMACS Home Page Alphabetical Index of DIMACS Web Pages Contacting the Center Document last modified on October 28, 2003.

54. Generic Programming Projects And Open Problems Generic Programming Projects and open problems. David R. Musser 1Rensselaer Polytechnic Institute Troy, New York 12180 musser@cs http://www.cs.rpi.edu/~musser/gp/pop/

Generic Programming Projects and Open Problems David R. Musser Rensselaer Polytechnic Institute Troy, New York 12180 musser@cs.rpi.edu Alexander A. Stepanov Silicon Graphics Inc. 2011 N. Shoreline Boulevard Mountain View, CA 94043-1389 stepanov@sgi.com Last updated: August 25, 1998 There is a At the Dagstuhl Seminar on Generic Programming The current state of this list should not, of course, be considered "complete" in any way. It is being made available on the WWW for the Dagstuhl participants and others to make additions or revisions. It will likely continually grow, but hopefully it can be pruned as projects are completed or open problems are solved! (These can be highlighted or maintained separately as a record of progress.) Suggestions are also sought for improving the level and type of information provided with projects and problems. For example, should there be a rating system to help readers understand the level of difficulty and/or importance attached to a project or problem by its proposer? Originally Alex Stepanov rated the projects on his list according to both difficulty and importance, each on a scale of 1 to 5. Those ratings are currently not included here, but if there is enough interest they could be added, perhaps after translation to an agreed-up scale. Revision History Postscript Version for Printing 1 Theory Concept Development ... Footnotes

55. Open Problems On Perfect Graphs In February of that year, Bruce and I prepared a list of open problems,which was then sent to all the invited participants. The http://www.cs.rutgers.edu/~chvatal/perfect/problems.html

PERFECT PROBLEMS Created on 22 August, 2000 Last updated on 11 February, 2003 In May 2002, the Strong Perfect Graph Conjecture became the Strong Perfect Graph Theorem Details are here. As a part of the 1992 1993 Special Year on Combinatorial Optimization at DIMACS ftp://dimacs.rutgers.edu/pub/perfect/problems.tex If you have information on progress towards solving these problems or complaints in case I did not give credit where credit was due or suggestions for problems to add, please, send them to me Related pages: Problems from the AIM Workshop on Perfect Graphs (compiled by Maria Chudnovsky) A bibliography on perfect graphs Home pages of people interested in perfect graphs This collection is written for people with at least a basic knowledge of perfect graphs. Uninformed neophytes may look up the missing definitions on the web in Alexander Schrijver's lecture notes or in Jerry Spinrad's draft of a book on efficient graph representations etc. or in Eric Weisstein's World of Mathematics . Books on perfect graphs include M. C. Golumbic

56. Daswani, Neil; Garcia-Molina, Hector; Yang, Beverly: Open Problems In Data-shari open problems in Datasharing Peer-to-peer Systems, ICDT 2003 In a Peer-To-Peer(P2P) system, autonomous computers pool their resources (eg, files, storage http://dbpubs.stanford.edu/pub/2003-1

Pagewise preview Category Value Available via http://dbpubs.stanford.edu/pub/2003-1 Submitted on 23rd of October 2002 Author Daswani, Neil; Garcia-Molina, Hector; Yang, Beverly Title Open Problems in Data-sharing Peer-to-peer Systems Date of publication January 2003 Published in ICDT 2003 Citation Daswani, Neil; Garcia-Molina, Hector; Yang, Beverly. Open Problems in Data-sharing Peer-to-peer Systems, ICDT 2003 Number of pages Language English Project Peers Type Conference or Journal Paper Subject group Miscellaneous Abstract In a Peer-To-Peer (P2P) system, autonomous computers pool their resources (e.g., files, storage, compute cycles) in order to inexpensively handle tasks that would normally require large costly servers. The scale of these systems, their "open nature," and the lack of centralized control pose difficult performance and security challenges. Much research has recently focused on tackling some of these challenges; in this paper, we propose future directions for research in P2P systems, and highlight problems that have not yet been studied in great depth. We focus on two particular aspects of P2P systems search and security and suggest several open and important research problems for the community to address. Keywords Peer-to-peer, search, security

57. Kézdy -- Some Open Problems K©zdy's open problems. http://athena.louisville.edu/~aekezd01/open/open.html

Sums Modulo n, Cyclic Neofields, and Tree Embeddings These problems arise from some of my work with Hunter Snevily (University of Idaho at Moscow, ID). Z n is alternating if f(i,j) = - f(j,i) (mod n), for all i,j. Permutations are viewed as sequences, so the permutation in S n is viewed as the sequence (n). For i,j, define the distance in from i to j, denoted d(i,j), as the quantity (j) - (i). Clearly d(i,j) = -d(j,i) (i.e. d is an alternating function). Conjecture A: f: [k] x [k] Z n , there exists a permutation in S k , such that d(i,j) f(i,j) (mod n), for all distinct i,j in [k] We have proven Conjecture A when n is prime. For a = (a ,a ,...,a k ) in Z n k , let (n, a ) denote the number of permutations in S k such that (n, a a in Z n k n ``, by H. Snevily, Amer. Math. Monthly, No. 6, June-July (1999), 584-585). Conjecture B : N(n,k) is monotone in n and k. Specifically, N(n,k) and N(n,k) Conjecture C : For n sufficiently large with respect to k, N(n,2k) = (k!) and N(n,2k+1) = (k+1)(k!) Note that, if true, Conjecture C would be sharp because a =(0,...0,n-1...n-1) achieves the bound (where the number of 0's is floor(k/2) and the number of n-1's is ceiling(k/2)).

58. Computational Algebraic Statistics This web page highlights some of the conjectures and open problemsconcerning Computational Algebraic Statistics. open problems. http://www.aimath.org/WWN/compalgstat/

Computational Algebraic Statistics This web page highlights some of the conjectures and open problems concerning Computational Algebraic Statistics. If you would like to print a hard copy of the whole outline, you can download a dvi postscript or pdf version. A list of participants is available. You may also wish to view the homework from Bernd Sturmfels Material from several workshop presentations is being compiled. Open problems The individual participant contributions may have problems because converting complicated TeX into a web page is not an exact science. The dvi, ps, or pdf versions are your best bet.

59. Open Problems Presented At SCG'98 open problems Presented at SCG 98. Problems presented at the openproblem sessionof the 14th Annual ACM Symposium on Computational Geometry are listed. http://www.cs.duke.edu/~pankaj/scg98-openprobs/

Open Problems Presented at SCG'98 Pankaj K. Agarwal Center for Geometric Computing, Dept. Computer Science, Duke University, Durham, NC 27708-0129. USA. Joseph O'Rourke Dept. of Computer Science, Smith College, Northampton, MA 01063, USA. Problems presented at the open-problem session of the 14th Annual ACM Symposium on Computational Geometry are listed. Jack Snoeyink , University of British Columbia: Given a set P of points and a set S of disjoint line segments in the plane, does there always exist a spanning tree of P that, when embedded with straight edges, has the property that no segment in S is cut by more than two edges? If the weight of an edge of the spanning tree is the number of segments of S S Note that an affirmative answer for the first problem implies an affirmative answer for the second. While a few constructions give spanning trees with O S S S S induce a triangulation; in general, the application is to locate many points in a triangulation by walking along some ``nice'' path. Disjointness of segments is important; otherwise spanning trees with low stabbing number give upper and lower bounds of O S Vadim Shapiro , University of Wisconsin: Given two smooth real algebraic hypersurfaces S and S defined by polynomials of degree at most d that are tangent along the curve C (i.e., the locus of second order contact is the curve

60. The Open Problems Project A project to record open problems of interest to researchers in computational geometry and related fields. http://www.cs.smith.edu/~orourke/TOPP/

Next: Numerical List of All The Open Problems Project edited by Erik D. Demaine Joseph S. B. Mitchell Joseph O'Rourke Introduction This is the beginning of a project to record open problems of interest to researchers in computational geometry and related fields. It commenced with the publication of thirty problems in Computational Geometry Column 42 [ ] (see Problems 1-30 ), but has grown much beyond that. We encourage correspondence to improve the entries; please send email to TOPP@cs.smith.edu . If you would like to submit a new problem, please fill out this template Each problem is assigned a unique number for citation purposes. Problem numbers also indicate the order in which the problems were entered. Each problem is classified as belonging to one or more categories. The problems are also available as a single Postscript or PDF file. To begin navigating through the open problems, you may select from a category of interest below, or view a list of all problems sorted numerically Categorized List of All Problems Below, each category lists the problems that are classified under that category. Note that each problem may be classified under several categories.

Page 3     41-60 of 151    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | Next 20