Sciweavers

1760 search results - page 111 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
SIGCOMM
1999
ACM
14 years 17 days ago
On Estimating End-to-End Network Path Properties
The more information about current network conditions available to a transport protocol, the more efficiently it can use the network to transfer its data. In networks such as the...
Mark Allman, Vern Paxson
INFOCOM
2007
IEEE
14 years 2 months ago
Shape Segmentation and Applications in Sensor Networks
—Many sensor network protocols in the literature implicitly assume that sensor nodes are deployed uniformly inside a simple geometric region. When the real deployment deviates fr...
Xianjin Zhu, Rik Sarkar, Jie Gao
AAAI
1990
13 years 9 months ago
An Approach to Reasoning About Continuous Change for Applications in Planning
There are many planning applications that require an agent to coordinate its activities with processes that change continuously over time. Several proposals have been made for com...
Thomas Dean, Greg Siegle
SEMWEB
2004
Springer
14 years 1 months ago
Bipartite Graphs as Intermediate Model for RDF
Abstract. RDF Graphs are sets of assertions in the form of subjectpredicate-object triples of information resources. Although for simple examples they can be understood intuitively...
Jonathan Hayes, Claudio Gutiérrez
GPEM
2008
128views more  GPEM 2008»
13 years 8 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood