Sciweavers

804 search results - page 20 / 161
» On the Termination of the Chase Algorithm
Sort
View
CN
2010
97views more  CN 2010»
14 years 10 months ago
PCN-based measured rate termination
Overload in a packet-based network can be prevented by admitting or blocking new flows depending on its load conditions. However, overload can occur in spite of admission control ...
Michael Menth, Frank Lehrieder
EAAI
2006
92views more  EAAI 2006»
14 years 10 months ago
Solving terminal assignment problems with groups encoding: The wedding banquet problem
This paper presents an extension of the terminal assignment problem (TA) in the case that groups of terminals must be assigned together. We analyze this situation by means of an e...
Sancho Salcedo-Sanz, José Antonio Portilla-...
INFOCOM
2007
IEEE
15 years 4 months ago
On Optimal Physical Carrier Sensing: Theoretical Analysis and Protocol Design
— Traditional Physical Carrier Sensing (PCS), which aims at eliminating hidden terminals in wireless networks, causes too many exposed terminals and deteriorates the throughput p...
Yanfeng Zhu, Qian Zhang, Zhisheng Niu, Jing Zhu
SEMWEB
2005
Springer
15 years 3 months ago
Containment and Minimization of RDF/S Query Patterns
Semantic query optimization (SQO) has been proved to be quite useful in various applications (e.g., data integration, graphical query generators, caching, etc.) and has been extens...
Giorgos Serfiotis, Ioanna Koffina, Vassilis Christ...
MASCOTS
2003
14 years 11 months ago
Toward Scaling Network Emulation using Topology Partitioning
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...
Ken Yocum, Ethan Eade, Julius Degesys, David Becke...