Sciweavers

1825 search results - page 214 / 365
» Local Dimensionality Reduction
Sort
View
HEURISTICS
2002
146views more  HEURISTICS 2002»
15 years 3 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...
ICASSP
2011
IEEE
14 years 7 months ago
Distributed Gaussian particle filtering using likelihood consensus
We propose a distributed implementation of the Gaussian particle filter (GPF) for use in a wireless sensor network. Each sensor runs a local GPF that computes a global state esti...
Ondrej Hlinka, Ondrej Sluciak, Franz Hlawatsch, Pe...
170
Voted
CVPR
2004
IEEE
16 years 6 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
133
Voted
CODES
2000
IEEE
15 years 8 months ago
Co-design of interleaved memory systems
Memory interleaving is a cost-efficient approach to increase bandwidth. Improving data access locality and reducing memory access conflicts are two important aspects to achieve hi...
Hua Lin, Wayne Wolf
168
Voted
FORMATS
2006
Springer
15 years 7 months ago
Adding Invariants to Event Zone Automata
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event o...
Peter Niebert, Hongyang Qu