Sciweavers

569 search results - page 80 / 114
» An Efficient Algorithm for Solving Dynamic Complex DCOP Prob...
Sort
View
EUROGP
2003
Springer
101views Optimization» more  EUROGP 2003»
14 years 25 days ago
An Enhanced Framework for Microprocessor Test-Program Generation
Test programs are fragment of code, but, unlike ordinary application programs, they are not intended to solve a problem, nor to calculate a function. Instead, they are supposed to ...
Fulvio Corno, Giovanni Squillero
CORR
2004
Springer
107views Education» more  CORR 2004»
13 years 7 months ago
Encapsulation for Practical Simplification Procedures
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
Olga Shumsky Matlin, William McCune
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
13 years 5 months ago
Reduction of interpolants for logic synthesis
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
John D. Backes, Marc D. Riedel
MOBIHOC
2009
ACM
14 years 8 months ago
Spectrum auction framework for access allocation in cognitive radio networks
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...
Gaurav S. Kasbekar, Saswati Sarkar
RIA
2006
60views more  RIA 2006»
13 years 7 months ago
GACS : une approche ascendante pour la coordination spatiale
ABSTRACT. The design of spatial coordination mechanisms for dynamical and continuous multiagent setting is a difficult challenge. While the top-down decomposition approach is ineff...
Fabien Flacher, Olivier Sigaud