Sciweavers

2911 search results - page 526 / 583
» A Logic of Graph Constraints
Sort
View
96
Voted
CONEXT
2007
ACM
15 years 4 months ago
The diameter of opportunistic mobile networks
Portable devices have more data storage and increasing communication capabilities everyday. In addition to classic infrastructure based communication, these devices can exploit hu...
Augustin Chaintreau, Abderrahmen Mtibaa, Laurent M...
93
Voted
AINA
2006
IEEE
15 years 4 months ago
Efficient Packet Scheduler For Wireless Ad Hoc Networks With Switched Beam Antennas
Using beam forming antennas in ad hoc networks have been recently focused on, in order to improve the space reuse. This news context implies to revisit network algorithms because t...
Gilles Grimaud, Antoine Honore, Hervé Meuni...
131
Voted
CAISE
2004
Springer
15 years 4 months ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 4 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
ICPR
2000
IEEE
15 years 4 months ago
MRF Solutions for Probabilistic Optical Flow Formulations
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
Sébastien Roy, Venu Govindu