Sciweavers

13841 search results - page 223 / 2769
» Algorithms and Constraint Programming
Sort
View
SODA
2004
ACM
161views Algorithms» more  SODA 2004»
15 years 8 months ago
Approximation schemes for Metric Bisection and partitioning
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
PLDI
2003
ACM
15 years 11 months ago
Checking and inferring local non-aliasing
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
Alexander Aiken, Jeffrey S. Foster, John Kodumal, ...
PPDP
2010
Springer
15 years 5 months ago
Graph queries through datalog optimizations
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L...
ARGMAS
2004
Springer
15 years 12 months ago
An Argument-Based Framework to Model an Agent's Beliefs in a Dynamic Environment
Abstract. One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’...
Marcela Capobianco, Carlos Iván Chesñ...
CONSTRAINTS
2007
83views more  CONSTRAINTS 2007»
15 years 6 months ago
Generic Incremental Algorithms for Local Search
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...
Magnus Ågren, Pierre Flener, Justin Pearson