Sciweavers

2254 search results - page 429 / 451
» Computing the minimal covering set
Sort
View
PLDI
2010
ACM
14 years 2 months ago
Smooth interpretation
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
Swarat Chaudhuri, Armando Solar-Lezama
MFCS
2001
Springer
14 years 2 months ago
News from the Online Traveling Repairman
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
Sven Oliver Krumke, Willem de Paepe, Diana Poensge...
EH
1999
IEEE
351views Hardware» more  EH 1999»
14 years 2 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
VISUALIZATION
1998
IEEE
14 years 2 months ago
Interactive out-of-core isosurface extraction
In this paper, we present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space req...
Yi-Jen Chiang, Cláudio T. Silva, William J....
FOCS
1997
IEEE
14 years 2 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...