Sciweavers

613 search results - page 11 / 123
» Finding and Fixing Faults
Sort
View
COCOON
2006
Springer
15 years 1 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
96
Voted
CATA
2004
14 years 11 months ago
Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
Fred J. Rispoli, Steven Cosares
NIPS
2004
14 years 10 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
MHCI
2004
Springer
15 years 2 months ago
Comparison of Mobile and Fixed Use of SmartLibrary
Abstract. Finding books in large libraries can be difficult for novice library users. This paper presents the current status of SmartLibrary, a web-based guidance application helpi...
Markus Aittola, Pekka Parhi, Maria Vieruaho, Timo ...
ICCAD
2000
IEEE
100views Hardware» more  ICCAD 2000»
15 years 1 months ago
Automated Data Dependency Size Estimation with a Partially Fixed Execution Ordering
For data dominated applications, the system level design trajectory should first focus on finding a good data transfer and storage solution. Since no realization details are avail...
Per Gunnar Kjeldsberg, Francky Catthoor, Einar J. ...