Sciweavers

12334 search results - page 2271 / 2467
» The Use of C
Sort
View
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
15 years 11 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov
IJCAI
1993
15 years 8 months ago
A Model-Theoretic Approach to the Verification of Situated Reasoning Systems
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
Anand S. Rao, Michael P. Georgeff
ATAL
2010
Springer
15 years 7 months ago
Exploiting scale invariant dynamics for efficient information propagation in large teams
Large heterogeneous teams will often be in situations where sensor data that is uncertain and conflicting is shared across a peer-to-peer network. Not every team member will have ...
Robin Glinton, Paul Scerri, Katia P. Sycara
CVPR
2000
IEEE
16 years 8 months ago
Chromatic Framework for Vision in Bad Weather
Conventional vision systems are designed to perform in clear weather. However, any outdoor vision system is incomplete without mechanisms that guarantee satisfactory performance u...
Srinivasa G. Narasimhan, Shree K. Nayar
WWW
2003
ACM
16 years 7 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
« Prev « First page 2271 / 2467 Last » Next »