Sciweavers

650 search results - page 100 / 130
» Positive graphs
Sort
View
AAAI
2007
14 years 6 days ago
The Impact of Network Topology on Pure Nash Equilibria in Graphical Games
Graphical games capture some of the key aspects relevant to the study and design of multi-agent systems. It is often of interest to find the conditions under which a game is stab...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 9 months ago
Sensor Networks with Random Links: Topology Design for Distributed Consensus
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
Soummya Kar, José M. F. Moura
LICS
2008
IEEE
14 years 4 months ago
A Neutral Approach to Proof and Refutation in MALL
We propose a setting in which the search for a proof of B or a refutation of B (a proof of ¬B) can be carried out simultaneously: this is in contrast to the usual approach in aut...
Olivier Delande, Dale Miller
WETICE
2007
IEEE
14 years 4 months ago
A Dominating Set Based Peer-to-Peer Protocol for Real-Time Multi-source Collaboration
Designing a collaborative architecture for real-time applications is an intricate challenge that usually involves dealing with the real-time constraints, resource limitations and ...
Dewan Tanvir Ahmed, Shervin Shirmohammadi, Abdulmo...
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
12 years 9 days ago
Approximate duality of multicommodity multiroute flows and cuts: single source case
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
Petr Kolman, Christian Scheideler