1840 search results - page 243 / 368 » time 2002 |
273
click to vote
POPL
2002
ACM
16 years 6 months ago
2002
ACM
Dataflow analyses can have mutually beneficial interactions. Previous efforts to exploit these interactions have either (1) iteratively performed each individual analysis until no...
253
click to vote
POPL
2002
ACM
16 years 6 months ago
2002
ACM
Functional logic overloading is a novel approach to userdefined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conce...
170
click to vote
CADE
2002
Springer
16 years 6 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
158
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
145
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...