Sciweavers

1615 search results - page 15 / 323
» Computer science and decision theory
Sort
View
LICS
2005
IEEE
14 years 1 months ago
A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams
Number Decision Diagrams (NDD) are the automatabased symbolic representation for manipulating sets of integer vectors encoded as strings of digit vectors (least or most significa...
Jérôme Leroux
MFCS
2004
Springer
14 years 28 days ago
Complexity of Decision Problems for Simple Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
Wim Martens, Frank Neven, Thomas Schwentick
HICSS
2007
IEEE
111views Biometrics» more  HICSS 2007»
14 years 1 months ago
Comprehensive Urban Planning: A Framework for Group Decision
Previous research in Group Support Systems does not include a design theory for GSS-enabled meetings. As a consequence, problems are experienced in the design, implementation and ...
Jim Sheffield
ITICSE
2004
ACM
14 years 1 months ago
Generation as method for explorative learning in computer science education
The use of generic and generative methods for the development and application of interactive educational software is a relatively unexplored area in industry and education. Advant...
Andreas Kerren
ISSAC
1994
Springer
102views Mathematics» more  ISSAC 1994»
13 years 11 months ago
An Application of Symbolic Computation in the Physical Sciences
An example of a problem in the physical sciences is discussed where application of various symbolic computation facilities available in many algebraic computing systems leads to a...
Charles C. Dyer