Sciweavers

1022 search results - page 22 / 205
» Challenges for Constraint Programming in Networking
Sort
View
85
Voted
ICLP
2005
Springer
15 years 6 months ago
Coordination of Many Agents
This paper presents a reactive programming and triggering framework for the coordination of a large number of distributed agents with shared knowledge. At the heart of this framewo...
Joxan Jaffar, Roland H. C. Yap, Kenny Qili Zhu
97
Voted
JAIR
2008
98views more  JAIR 2008»
15 years 13 days ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...
152
Voted
PTS
2010
175views Hardware» more  PTS 2010»
14 years 10 months ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
Christoph Gladisch
133
Voted
SNPD
2003
15 years 1 months ago
Deductive and Inductive Methods for Program Synthesis
The paper discusses simple functional constraint networks and a value propagation method for program construction. Structural synthesis of programs is described as an example of d...
Jaan Penjam, Elena Sanko
102
Voted
CORR
2008
Springer
153views Education» more  CORR 2008»
15 years 16 days ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...