Sciweavers

4555 search results - page 144 / 911
» Deductive Algorithmic Knowledge
Sort
View
IPL
2010
109views more  IPL 2010»
13 years 5 months ago
A new parameter for a broadcast algorithm with locally bounded Byzantine faults
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a c...
Akira Ichimura, Maiko Shigeno
INFOCOM
2007
IEEE
14 years 5 months ago
An Optimal Algorithm for Minimizing Energy Consumption while Limiting Maximum Delay in a Mesh Sensor Network
— This paper presents an algorithm for maximizing the lifetime of a sensor network while guaranteeing an upper bound on the end-to-end delay. We prove that the proposed algorithm...
Reuven Cohen, Boris Kapchits
AAAI
2006
14 years 6 days ago
Acquiring Constraint Networks Using a SAT-based Version Space Algorithm
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model the...
Christian Bessière, Remi Coletta, Fré...
WSDM
2012
ACM
252views Data Mining» more  WSDM 2012»
12 years 6 months ago
WebSets: extracting sets of entities from the web using unsupervised information extraction
We describe a open-domain information extraction method for extracting concept-instance pairs from an HTML corpus. Most earlier approaches to this problem rely on combining cluste...
Bhavana Bharat Dalvi, William W. Cohen, Jamie Call...
ICC
2009
IEEE
155views Communications» more  ICC 2009»
14 years 5 months ago
Modeling Random Walk Search Algorithms in Unstructured P2P Networks with Social Information
—Random walk (RW) has been widely used as a strategy for searching in peer-to-peer networks. The boom of social network applications introduces new impact to the classical algori...
Jing Xie, King-Shan Lui