681 search results - page 90 / 137 » General Polynomial Time Decomposition Algorithms |
137
Voted
SWAT
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
117
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
124
Voted
FPL
2008
Springer
15 years 2 months ago
2008
Springer
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit the changing needs of a computation during run time. The increa...
148
Voted
PODS
2011
ACM
14 years 3 months ago
2011
ACM
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
116
Voted
AAAI
2008
15 years 2 months ago
2008
This paper considers the problem of an agent searching for a resource or a tangible good in a physical environment, where at each stage of its search it observes one source where ...