7930 search results - page 596 / 1586 » Greedy in Approximation Algorithms |
195
click to vote
SAT
2005
Springer
16 years 20 days ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
179
click to vote
APWEB
2004
Springer
16 years 17 days ago
2004
Springer
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
176
click to vote
ICGI
2004
Springer
16 years 17 days ago
2004
Springer
State Merging algorithms, such as Rodney Price’s EDSM (Evidence-Driven State Merging) algorithm, have been reasonably successful at solving DFA-learning problems. EDSM, however, ...
192
click to vote
SC
2003
ACM
16 years 13 days ago
2003
ACM
This paper presents an algorithm for implementing optimal hardware-based multicast trees, on networks that provide hardware support for collective communication. Although the prop...
193
click to vote
CIKM
2001
Springer
15 years 11 months ago
2001
Springer
Existing approaches for optimizing queries in data integration use decoupled strategies–attempting to optimize coverage and cost in two separate phases. Since sources tend to ha...