3625 search results - page 44 / 725 » On choosing |
IPL
2000
14 years 11 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
JSYML
2000
14 years 11 months ago
2000
The choice construct (choose x : '(x)) is useful in software speci cations. We study extensions of rst-order logic with the choice construct. We prove some results about Hilb...
CN
1999
14 years 11 months ago
1999
Widespread replication of information can ameliorate the problem of server overloading but raises the allied question of server selection. Clients may be assigned to a replica in ...
SIGMOD
2008
ACM
14 years 11 months ago
2008
ACM
There are hundreds of us in academia and industry who consider ourselves FoJ: Friends of Jim. Jim invested so deeply and so uniquely in every one of us that we each felt we must b...
113
click to vote
COLOGNETWENTE
2010
14 years 10 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...