1144 search results - page 190 / 229 » Logic programming for combinatorial problems |
138
click to vote
PLDI
2010
ACM
15 years 7 months ago
2010
ACM
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
126
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
125
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...
124
click to vote
DAM
2007
15 years 1 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...