Sciweavers

16257 search results - page 3223 / 3252
» D-finiteness: algorithms and applications
Sort
View
INFORMS
1998
150views more  INFORMS 1998»
13 years 9 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
KI
2002
Springer
13 years 9 months ago
Formal Properties of Constraint Calculi for Qualitative Spatial Reasoning
In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property...
Bernhard Nebel, Alexander Scivos
SCP
1998
112views more  SCP 1998»
13 years 9 months ago
Structured Gamma
The Gamma language is based on the chemical reaction metaphor which has a number of benefits with respect to parallelism and program derivation. But the original definition of G...
Pascal Fradet, Daniel Le Métayer
SIAMDM
1998
89views more  SIAMDM 1998»
13 years 9 months ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky
TOSEM
1998
80views more  TOSEM 1998»
13 years 9 months ago
Discovering Models of Software Processes from Event-Based Data
Many software process methods and tools presuppose the existence of a formal model of a process. Unfortunately, developing a formal model for an on-going, complex process can be d...
Jonathan E. Cook, Alexander L. Wolf
« Prev « First page 3223 / 3252 Last » Next »