412 search results - page 24 / 83 » A New Proof of the F5 Algorithm |
AAAI
2008
15 years 4 days ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
104
click to vote
PLDI
2006
ACM
15 years 3 months ago
2006
ACM
Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous such algorithms have been proposed, implemented, and deployed – and yet the relations...
ICDCSW
2005
IEEE
15 years 3 months ago
2005
IEEE
Content-based event matching is an important problem in large-scale event-based publish/subscribe systems. However, open questions remain in ...
102
click to vote
AUTOMATICA
2007
14 years 10 months ago
2007
This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
The focus of this paper is on how to design evolutionary algorithms (EAs) for solving stochastic dynamic optimization problems online, i.e. as time goes by. For a proper design, t...