Sciweavers

269 search results - page 50 / 54
» A branch and bound method for stochastic global optimization
Sort
View
ECCV
2002
Springer
15 years 11 months ago
Visual Data Fusion for Objects Localization by Active Vision
Visual sensors provide exclusively uncertain and partial knowledge of a scene. In this article, we present a suitable scene knowledge representation that makes integration and fusi...
François Chaumette, Grégory Flandin
PE
2010
Springer
212views Optimization» more  PE 2010»
14 years 4 months ago
Modeling TCP throughput: An elaborated large-deviations-based model and its empirical validation
In today's Internet, a large part of the traffic is carried using the TCP transport protocol. Characterization of the variations of TCP traffic is thus a major challenge, bot...
Patrick Loiseau, Paulo Gonçalves, Julien Ba...
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
14 years 9 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
JPDC
2006
187views more  JPDC 2006»
14 years 9 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna
78
Voted
IPPS
2007
IEEE
15 years 3 months ago
A Semi-Distributed Axiomatic Game Theoretical Mechanism for Replicating Data Objects in Large Distributed Computing Systems
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
Samee Ullah Khan, Ishfaq Ahmad