3875 search results - page 652 / 775 » Approximation algorithms for the 0-extension problem |
123
click to vote
IJCAI
1997
15 years 5 months ago
1997
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...
136
click to vote
PODS
2010
ACM
15 years 4 months ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
167
click to vote
COMCOM
2010
15 years 4 months ago
2010
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...
160
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
154
click to vote
TKDE
2008
15 years 4 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...