Sciweavers

989 search results - page 137 / 198
» Version spaces and the consistency problem
Sort
View
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
15 years 11 months ago
Constructing exact octagonal steiner minimal trees
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
Chris Coulston
LICS
1993
IEEE
15 years 10 months ago
Verifying Programs with Unreliable Channels
We consider the veri cation of a particular class of in nite-state systems, namely systems consisting of nite-state processes that communicate via unbounded lossy FIFO channels. T...
Parosh Aziz Abdulla, Bengt Jonsson
161
Voted
FGR
2004
IEEE
161views Biometrics» more  FGR 2004»
15 years 9 months ago
AdaBoost with Totally Corrective Updates for Fast Face Detection
An extension of the AdaBoost learning algorithm is proposed and brought to bear on the face detection problem. In each weak classifier selection cycle, the novel totally correctiv...
Jan Sochman, Jiri Matas
FORMATS
2006
Springer
15 years 9 months ago
Concurrent Semantics Without the Notions of State or State Transitions
This paper argues that basing the semantics of concurrent systems on the notions of state and state transitions is neither advisable nor necessary. The tendency to do this is deepl...
Edward A. Lee
AIPS
2006
15 years 7 months ago
Planning with Temporally Extended Goals Using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
Jorge A. Baier, Sheila A. McIlraith