14165 search results - page 458 / 2833 » The generalized two-server problem |
216
click to vote
APPROX
2005
Springer
16 years 13 days ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
193
click to vote
VLDB
2005
ACM
16 years 11 days ago
2005
ACM
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
246
click to vote
FOCS
2002
IEEE
15 years 12 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
179
click to vote
ECAI
2000
Springer
15 years 11 months ago
2000
Springer
Many complex real-world decision problems, such as planning, contain an underlying constraint reasoning problem. The feasibility of a solution candidate then depends on the consis...
182
click to vote
AIPS
2006
15 years 8 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...