13376 search results - page 347 / 2676 » Problem Solving with |
126
click to vote
PLDI
2010
ACM
16 years 1 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
145
Voted
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
118
click to vote
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
124
click to vote
ANOR
2008
15 years 4 months ago
2008
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
127
click to vote
ICCAD
1997
IEEE
15 years 8 months ago
1997
IEEE
We present a new output encoding problem as follows: Given a specification table, such as a truth table or a finite state machine state table, where some of the outputs are specif...