Sciweavers

13841 search results - page 351 / 2769
» Algorithms and Constraint Programming
Sort
View
FLAIRS
2006
15 years 8 months ago
Which Dynamic Constraint Problems Can Be Solved By Ants?
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
Koenraad Mertens, Tom Holvoet, Yolande Berbers
SAC
2010
ACM
16 years 1 months ago
Relational consistency by constraint filtering
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
Shant Karakashian, Robert J. Woodward, Berthe Y. C...
DATE
2006
IEEE
101views Hardware» more  DATE 2006»
16 years 25 days ago
Cooptimization of interface hardware and software for I/O controllers
The allocation of device variables on I/O registers affects the code size and performance of an I/O device driver. This work seeks the allocation with the minimal software or hard...
Kuan Jen Lin, Shih Hao Huang, Shan Chien Fang
ICCAD
2004
IEEE
115views Hardware» more  ICCAD 2004»
16 years 3 months ago
Gate sizing for crosstalk reduction under timing constraints by Lagrangian relaxation
Abstract— This paper presents a post-route, timingconstrained gate-sizing algorithm for crosstalk reduction. Gate-sizing has emerged as a practical and feasible method to reduce ...
Debjit Sinha, Hai Zhou
ATAL
2006
Springer
15 years 10 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara