Sciweavers

551 search results - page 19 / 111
» Continuous Search in Constraint Programming
Sort
View
AAAI
2008
13 years 11 months ago
Efficient Memoization for Dynamic Programming with Ad-Hoc Constraints
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
CP
2004
Springer
14 years 2 months ago
Challenges for Constraint Programming in Networking
In this talk we present a number of problems for network design, planning and analysis and show how they can be addressed with different hybrid CP solutions. Clearly, this problem...
Helmut Simonis
CPAIOR
2010
Springer
14 years 1 months ago
Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
Madjid Khichane, Patrick Albert, Christine Solnon
CIKM
2006
Springer
14 years 16 days ago
Maximizing the sustained throughput of distributed continuous queries
Monitoring systems today often involve continuous queries over streaming data, in a distributed collaborative system. The distribution of query operators over a network of process...
Ioana Stanoi, George A. Mihaila, Themis Palpanas, ...
ICRA
2010
IEEE
157views Robotics» more  ICRA 2010»
13 years 7 months ago
Sampling-Based Motion and Symbolic Action Planning with geometric and differential constraints
Abstract— To compute collision-free and dynamicallyfeasibile trajectories that satisfy high-level specifications given in a planning-domain definition language, this paper prop...
Erion Plaku, Gregory D. Hager