Sciweavers

915 search results - page 146 / 183
» Maximally Abstract Retrenchments
Sort
View
AINA
2010
IEEE
13 years 11 months ago
PRoPHET+: An Adaptive PRoPHET-Based Routing Protocol for Opportunistic Network
Abstract—We propose PRoPHET+, a routing scheme for opportunistic networks designed to maximize successful data delivery rate and minimize transmission delay. PRoPHET+ computes a ...
Ting-Kai Huang, Chia-Keng Lee, Ling-Jyh Chen
DALT
2009
Springer
13 years 11 months ago
Prioritized Goals and Subgoals in a Logical Account of Goal Change - A Preliminary Report
Abstract. Most previous logical accounts of goal change do not deal with prioritized goals and do not handle subgoals and their dynamics properly. Many are restricted to achievemen...
Shakil M. Khan, Yves Lespérance
ICALP
2010
Springer
13 years 10 months ago
Covering and Packing in Linear Space
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
CG
2008
Springer
13 years 10 months ago
Extended Null-Move Reductions
Abstract. In this paper we review the conventional versions of nullmove pruning, and present our enhancements which allow for a deeper search with greater accuracy. While the conve...
Omid David-Tabibi, Nathan S. Netanyahu
ASPDAC
2005
ACM
78views Hardware» more  ASPDAC 2005»
13 years 10 months ago
Timing driven track routing considering coupling capacitance
Abstract— As VLSI technology enters the ultra-deep submicron era, wire coupling capacitance starts to dominate self capacitance and can no longer be neglected in timing driven ro...
Di Wu, Jiang Hu, Min Zhao, Rabi N. Mahapatra