Sciweavers

2398 search results - page 123 / 480
» Constraint Programming and Graph Algorithms
Sort
View
135
Voted
CP
2004
Springer
15 years 10 months ago
Disjoint, Partition and Intersection Constraints for Set and Multiset Variables
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints in conjunction with cardi...
Christian Bessière, Emmanuel Hebrard, Brahi...
ASP
2005
Springer
15 years 10 months ago
A Preliminary Report on Integrating of Answer Set and Constraint Solving
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
Sabrina Baselice, Piero A. Bonatti, Michael Gelfon...
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
15 years 6 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
PPCP
1993
15 years 9 months ago
Practical Issues in Graphical Constraints
Use of constraint-based techniques in interactive graphics applications poses a variety of unique challenges to system implementors. This paper begins by describing how interface ...
Michael Gleicher
132
Voted
AAAI
2006
15 years 6 months ago
Focused Real-Time Dynamic Programming for MDPs: Squeezing More Out of a Heuristic
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
Trey Smith, Reid G. Simmons