2636 search results - page 230 / 528 » Linear Programming |
109
Voted
CSB
2005
IEEE
15 years 8 months ago
2005
IEEE
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
126
Voted
LPNMR
2001
Springer
15 years 7 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
123
Voted
PLDI
1997
ACM
15 years 7 months ago
1997
ACM
We present a simple and novel framework for generating blocked codes for high-performance machines with a memory hierarchy. Unlike traditional compiler techniques like tiling, whi...
122
Voted
IPCO
2008
15 years 4 months ago
2008
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
86
Voted
AMAI
2002
Springer
15 years 2 months ago
2002
Springer
The technique of watching two literals per clause to determine when a clause becomes a unit clause was introduced recently in the Chaff satisfiability program. That program does n...