Sciweavers

283 search results - page 55 / 57
» Solving Over-Constrained Problems with SAT
Sort
View
CAV
2004
Springer
151views Hardware» more  CAV 2004»
15 years 3 months ago
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Ganesh Gopalakrishnan, Yue Yang, Hemanthkumar Siva...
ECP
1997
Springer
128views Robotics» more  ECP 1997»
15 years 3 months ago
SINERGY: A Linear Planner Based on Genetic Programming
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
Ion Muslea
ICC
2007
IEEE
116views Communications» more  ICC 2007»
15 years 6 months ago
Fast Handover Scheme for Real-Time Applications in Mobile WiMAX
—Mobile WiMAX is one of the most promising technologies for broadband wireless communication. The IEEE 802.16e standard for Mobile WiMAX, the enhanced version of the IEEE 802.16 ...
Wenhua Jiao, Pin Jiang, Yuanyuan Ma
GECCO
2004
Springer
15 years 5 months ago
Improving the Performance of a Genetic Algorithm Using a Variable-Reordering Algorithm
Genetic algorithms have been successfully applied to many difficult problems but there have been some disappointing results as well. In these cases the choice of the internal repre...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
AISC
2008
Springer
15 years 1 months ago
Search Techniques for Rational Polynomial Orders
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto,...