Sciweavers

3894 search results - page 515 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
QEST
2008
IEEE
15 years 10 months ago
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye...
ICRA
2006
IEEE
120views Robotics» more  ICRA 2006»
15 years 10 months ago
Autonomous Enhancement of Disruption Tolerant Networks
— Mobile robots have successfully solved many real world problems. In the following we present the use of mobile robots to address the novel and challenging problem of providing ...
Brendan Burns, Oliver Brock, Brian Neil Levine
COMPGEOM
2006
ACM
15 years 10 months ago
Minimum-cost load-balancing partitions
We consider the problem of balancing the load among m service-providing facilities, while keeping the total cost low. Let R be the underlying demand region, and let p1, . . . , pm...
Boris Aronov, Paz Carmi, Matthew J. Katz
ECML
2005
Springer
15 years 9 months ago
Fitting the Smallest Enclosing Bregman Ball
Finding a point which minimizes the maximal distortion with respect to a dataset is an important estimation problem that has recently received growing attentions in machine learnin...
Richard Nock, Frank Nielsen
ICDCN
2009
Springer
15 years 8 months ago
Optimizing Multi-hop Queries in ZigBee Based Multi-sink Sensor Networks
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
Bing Han, Gwendal Simon