Sciweavers

11740 search results - page 187 / 2348
» More Problems in Rewriting
Sort
View
CSL
2009
Springer
15 years 11 months ago
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems
Abstract. We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-...
Albert Atserias, Mark Weyer
CCGRID
2007
IEEE
15 years 10 months ago
Build-and-Test Workloads for Grid Middleware: Problem, Analysis, and Applications
The Grid promise is starting to materialize today: largescale multi-site infrastructures have grown to assist the work of scientists from all around the world. This tremendous gro...
Alexandru Iosup, Dick H. J. Epema
EUROPAR
2007
Springer
15 years 10 months ago
Decision Trees and MPI Collective Algorithm Selection Problem
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...
Jelena Pjesivac-Grbovic, George Bosilca, Graham E....
GECCO
2007
Springer
143views Optimization» more  GECCO 2007»
15 years 10 months ago
Learning and exploiting knowledge in multi-agent task allocation problems
Imagine a group of cooperating agents attempting to allocate tasks amongst themselves without knowledge of their own capabilities. Over time, they develop a belief of their own sk...
Adam Campbell, Annie S. Wu
QSHINE
2005
IEEE
15 years 10 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves