Sciweavers

2398 search results - page 185 / 480
» Constraint Programming and Graph Algorithms
Sort
View
JMLR
2012
13 years 8 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
KR
2004
Springer
15 years 11 months ago
Planning Graphs and Knowledge Compilation
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
Hector Geffner
CP
2003
Springer
15 years 11 months ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
SIAMJO
2010
100views more  SIAMJO 2010»
15 years 1 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
CGO
2006
IEEE
16 years 14 days ago
Compiling for EDGE Architectures
Explicit Data Graph Execution (EDGE) architectures offer the possibility of high instruction-level parallelism with energy efficiency. In EDGE architectures, the compiler breaks ...
Aaron Smith, Jon Gibson, Bertrand A. Maher, Nichol...