Sciweavers

1176 search results - page 15 / 236
» Implicit Abstraction Heuristics
Sort
View
VLSID
2000
IEEE
75views VLSI» more  VLSID 2000»
14 years 2 months ago
Timing Analysis with Implicitly Specified False Paths
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
Eugene Goldberg, Alexander Saldanha
IJCV
2007
117views more  IJCV 2007»
13 years 9 months ago
Implicit Meshes for Effective Silhouette Handling
Abstract. Using silhouettes in uncontrolled environments typically requires handling occlusions as well as changing or cluttered backgrounds, which limits the applicability of most...
Slobodan Ilic, Mathieu Salzmann, Pascal Fua
CEC
2010
IEEE
13 years 1 months ago
Discriminating normal and cancerous thyroid cell lines using implicit context representation Cartesian genetic programming
Abstract— In this paper, we describe a method for discriminating between thyroid cell lines. Five commercial thyroid cell lines were obtained, ranging from non-cancerous to cance...
Michael A. Lones, Stephen L. Smith, Andrew T. Harr...
4OR
2008
79views more  4OR 2008»
13 years 10 months ago
MIP-based heuristic for non-standard 3D-packing problems
This paper is the continuation of a previous work (Fasano 2004), dedicated to a MIP formulation for non-standard three-dimensional packing issues, with additional conditions. The ...
Giorgio Fasano
CONCUR
2000
Springer
14 years 2 months ago
An Implicitly-Typed Deadlock-Free Process Calculus
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
Naoki Kobayashi, Shin Saito, Eijiro Sumii