Sciweavers

4451 search results - page 135 / 891
» On Random Ordering Constraints
Sort
View
156
Voted
ICCAD
1994
IEEE
137views Hardware» more  ICCAD 1994»
15 years 8 months ago
Dynamic scheduling and synchronization synthesis of concurrent digital systems under system-level constraints
We present in this paper a novel control synthesis technique for system-level specifications that are better described as a set of concurrent synchronous descriptions, their synch...
Claudionor José Nunes Coelho Jr., Giovanni ...
HEURISTICS
2002
146views more  HEURISTICS 2002»
15 years 4 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
ICPR
2002
IEEE
16 years 5 months ago
Illumination Invariant Segmentation of Spatio-Temporal Images by Spatio-Temporal Markov Random Field Model
For many years, object tracking in images has suffered from the problems of occlusions and illumination effects. In order to resolve occlusion problems, we have been proposing the...
Shunsuke Kamijo, Katsushi Ikeuchi, Masao Sakauchi
ICML
2004
IEEE
16 years 5 months ago
Training conditional random fields via gradient tree boosting
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
Thomas G. Dietterich, Adam Ashenfelter, Yaroslav B...
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
16 years 5 months ago
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
Stephen D. Bay, Mark Schwabacher