Sciweavers

959 search results - page 70 / 192
» New Techniques for Algorithm Portfolio Design
Sort
View
DAC
2006
ACM
16 years 25 days ago
Automatic invariant strengthening to prove properties in bounded model checking
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...
Mohammad Awedh, Fabio Somenzi
FLAIRS
2004
15 years 1 months ago
Iterative Improvement of Neural Classifiers
A new objective function for neural net classifier design is presented, which has more free parameters than the classical objective function. An iterative minimization technique f...
Jiang Li, Michael T. Manry, Li-min Liu, Changhua Y...
INFOCOM
2009
IEEE
15 years 6 months ago
Opportunistic Routing Algebra and its Applications
Abstract—Opportunistic routing (OR) has received much attention as a new routing paradigm due to its efficient utilization of broadcasting and spacial diversity of the wireless ...
Mingming Lu, Jie Wu
TCAD
2002
146views more  TCAD 2002»
14 years 11 months ago
Static scheduling of multidomain circuits for fast functional verification
With the advent of system-on-a-chip design, many application specific integrated circuits (ASICs) now require multiple design clocks that operate asynchronously to each other. This...
Murali Kudlugi, Russell Tessier
SAT
2004
Springer
95views Hardware» more  SAT 2004»
15 years 5 months ago
Local Search for Very Large SAT Problems
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
Steven David Prestwich, Colin Quirke