Sciweavers

893 search results - page 37 / 179
» P3C: A New Algorithm for the Simple Temporal Problem
Sort
View
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 1 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
13 years 12 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...
ISBI
2002
IEEE
14 years 8 months ago
Cardiac ultrasound motion detection by elastic registration exploiting temporal coherence
We propose a new global registration method for estimating the cardiac displacement field in 2D sequences of ultrasound images of the heart. The basic idea is to select a referenc...
Andrés Santos, Jan Kybic, Manuel Desco, Mar...
ASPLOS
2006
ACM
14 years 1 months ago
Temporal search: detecting hidden malware timebombs with virtual machines
Worms, viruses, and other malware can be ticking bombs counting down to a specific time, when they might, for example, delete files or download new instructions from a public we...
Jedidiah R. Crandall, Gary Wassermann, Daniela A. ...
NIPS
2001
13 years 9 months ago
Model-Free Least-Squares Policy Iteration
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
Michail G. Lagoudakis, Ronald Parr