Sciweavers

156 search results - page 27 / 32
» Parallel SAT Solving using Bit-level Operations
Sort
View
WEA
2004
Springer
124views Algorithms» more  WEA 2004»
15 years 5 months ago
Experimental Studies of Symbolic Shortest-Path Algorithms
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
Daniel Sawitzki
DEBS
2003
ACM
15 years 4 months ago
Client mobility in rendezvous-notify
Event-based computing is vital for the next generation mobile services and applications that need to meet user requirements irrespective of time and location. The event paradigm i...
Sasu Tarkoma, Jaakko Kangasharju, Kimmo E. E. Raat...
NECO
2008
129views more  NECO 2008»
14 years 11 months ago
Sparse Coding via Thresholding and Local Competition in Neural Circuits
While evidence indicates that neural systems may be employing sparse approximations to represent sensed stimuli, the mechanisms underlying this ability are not understood. We desc...
Christopher J. Rozell, Don H. Johnson, Richard G. ...
TSMC
2002
156views more  TSMC 2002»
14 years 11 months ago
Varieties of learning automata: an overview
Automata models of learning systems introduced in the 1960s were popularized as learning automata (LA) in a survey paper in 1974 [1]. Since then, there have been many fundamental a...
M. A. L. Thathachar, P. Shanti Sastry
ISORC
2000
IEEE
15 years 4 months ago
Architecture, Design Methodology, and Component-Based Tools for a Real-Time Inspection System
We describe a real-time, component-based system for an inspection application. We chose the inspection application and the accompanying task (or scenario) so that we might fully e...
John Albert Horst