430 search results - page 7 / 86 » On Using Satisfiability-Based Pruning Techniques in Covering... |
149
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
The unarguably fast, and continuous, growth of the volume of indexed (and indexable) documents on the Web poses a great challenge for search engines. This is true regarding not on...
157
Voted
TCS
2008
15 years 6 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
186
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
160
Voted
FASE
2010
Springer
16 years 28 days ago
2010
Springer
Actor programs consist of a number of concurrent objects called actors, which communicate by exchanging messages. Nondeterminism in actors results from the different possible orde...
127
Voted
IDEAS
2008
IEEE
16 years 16 days ago
2008
IEEE
Data stored in a data warehouse are inherently multidimensional, but most data-pruning techniques (such as iceberg and top-k queries) are unidimensional. However, analysts need to...