Sciweavers

1964 search results - page 107 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
DFT
2009
IEEE
210views VLSI» more  DFT 2009»
13 years 11 months ago
Optimizing Parametric BIST Using Bio-inspired Computing Algorithms
Optimizing the BIST configuration based on the characteristics of the design under test is a complicated and challenging work for test engineers. Since this problem has multiple o...
Nastaran Nemati, Amirhossein Simjour, Amirali Ghof...
IJCAI
1989
13 years 9 months ago
Approximation Algorithms for Temporal Reasoning
We consider a representation for temporal relations between intervals introduced by James Allen, and its associated computational or reasoning problem: given possibly indefinite ...
Peter van Beek
ECAI
2008
Springer
13 years 9 months ago
Theoretical Study of Ant-based Algorithms for Multi-Agent Patrolling
This paper addresses the multi-agent patrolling problem, which consists for a set of autonomous agents to visit all the places of an unknown environment as regularly as possible. T...
Arnaud Glad, Olivier Simonin, Olivier Buffet, Fran...
EOR
2008
90views more  EOR 2008»
13 years 8 months ago
An improved simulated annealing algorithm for bandwidth minimization
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
NIPS
2003
13 years 9 months ago
Online Passive-Aggressive Algorithms
We present a family of margin based online learning algorithms for various prediction tasks. In particular we derive and analyze algorithms for binary and multiclass categorizatio...
Shai Shalev-Shwartz, Koby Crammer, Ofer Dekel, Yor...