Sciweavers

109 search results - page 16 / 22
» Faulty Random Geometric Networks
Sort
View
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
15 years 1 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher
96
Voted
DAC
2005
ACM
16 years 19 days ago
Designing logic circuits for probabilistic computation in the presence of noise
As Si CMOS devices are scaled down into the nanoscale regime, current computer architecture approaches are reaching their practical limits. Future nano-architectures will confront...
Kundan Nepal, R. Iris Bahar, Joseph L. Mundy, Will...
KDD
2003
ACM
205views Data Mining» more  KDD 2003»
16 years 2 days ago
The data mining approach to automated software testing
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
Mark Last, Menahem Friedman, Abraham Kandel
INFOCOM
2005
IEEE
15 years 5 months ago
Perfect simulation and stationarity of a class of mobility models
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
Jean-Yves Le Boudec, Milan Vojnovic
DCOSS
2011
Springer
13 years 11 months ago
Planning the trajectories of multiple mobile sinks in large-scale, time-sensitive WSNs
—Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of wireless sensor networks (WSNs) by avoiding the typical hot-spot problem near the sink...
Wint Yi Poe, Michael Beck, Jens B. Schmitt