Sciweavers

3820 search results - page 668 / 764
» Bounded Model Debugging
Sort
View
IJON
2007
93views more  IJON 2007»
13 years 10 months ago
How much can we trust neural simulation strategies?
Despite a steady improvement of computational hardware, results of numerical simulation are still tightly bound to the simulation tool and strategy used, and may substantially var...
Michelle Rudolph, Alain Destexhe
TALG
2008
124views more  TALG 2008»
13 years 10 months ago
Uniform deterministic dictionaries
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
Milan Ruzic
TASE
2008
IEEE
13 years 10 months ago
Sensor Selection in Arbitrary Dimensions
We address the sensor selection problem which arises in tracking and localization applications. In sensor selection, the goal is to select a small number of sensors whose measureme...
Volkan Isler, Malik Magdon-Ismail
TCS
2008
13 years 10 months ago
Cleaning a network with brushes
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
Margaret-Ellen Messinger, Richard J. Nowakowski, P...
TIT
2008
119views more  TIT 2008»
13 years 10 months ago
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
We address the question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time. We consider a simple distributed sched...
Prasanna Chaporkar, Koushik Kar, Xiang Luo, Saswat...