Sciweavers

2181 search results - page 58 / 437
» The restriction scaffold problem
Sort
View
HICSS
2008
IEEE
199views Biometrics» more  HICSS 2008»
14 years 3 months ago
Clustering and the Biclique Partition Problem
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
Doina Bein, Linda Morales, Wolfgang W. Bein, C. O....
CEEMAS
2005
Springer
14 years 2 months ago
On Communication in Solving Distributed Constraint Satisfaction Problems
Abstract. Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multi-agent coordination and conflict resolution. In most DCSP algorithms, inter-agent com...
Hyuckchul Jung, Milind Tambe
IWPEC
2004
Springer
14 years 2 months ago
Parameterized Coloring Problems on Chordal Graphs
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
Dániel Marx
INFOCOM
2002
IEEE
14 years 1 months ago
Travelling Miser Problem
— Various monitoring and performance evaluation tools generate considerable amount of low priority traffic. This information is not always needed in real time, and thus could of...
Yuval Shavitt, David Breitgand, Danny Raz
AAAI
2006
13 years 10 months ago
Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
Héctor Palacios, Hector Geffner