Sciweavers

2304 search results - page 400 / 461
» On the Vulnerability of Large Graphs
Sort
View
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 10 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
JGT
2008
88views more  JGT 2008»
13 years 10 months ago
On k-detour subgraphs of hypercubes
A spanning subgraph G of a graph H is a k-detour subgraph of H if for each pair of vertices x, y V (H), the distance, distG(x, y), between x and y in G exceeds that in H by at mo...
Nana Arizumi, Peter Hamburger, Alexandr V. Kostoch...
JAIR
2006
89views more  JAIR 2006»
13 years 10 months ago
Distributed Reasoning in a Peer-to-Peer Setting: Application to the Semantic Web
In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we ...
Philippe Adjiman, Philippe Chatalic, Franço...
KAIS
2008
109views more  KAIS 2008»
13 years 10 months ago
Knowledge-empowered automated negotiation system for e-Commerce
This paper focuses on knowledge empowered automated negotiation systems for buyer-centric multi-bilateral multi-attribute e-Procurement. We propose two knowledge empowered models,...
Zhuang Yan, Simon Fong, Meilin Shi
JSA
2006
131views more  JSA 2006»
13 years 10 months ago
Bidirectional liveness analysis, or how less than half of the Alpha's registers are used
Interprocedural data flow analyses of executable programs suffer from the conservative assumptions that need to be made because no precise control flow graph is available and beca...
Bjorn De Sutter, Bruno De Bus, Koen De Bosschere