Sciweavers

2926 search results - page 254 / 586
» Partially Optimal Routing
Sort
View
136
Voted
AIPS
2008
15 years 6 months ago
Fast Planning for Dynamic Preferences
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
Brian Ziebart, Anind K. Dey, J. Andrew Bagnell
DAC
2003
ACM
16 years 5 months ago
Optimal integer delay budgeting on directed acyclic graphs
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
Elaheh Bozorgzadeh, Soheil Ghiasi, Atsushi Takahas...
154
Voted
TON
2010
147views more  TON 2010»
15 years 2 months ago
Coverage-time optimization for clustered wireless sensor networks: a power-balancing approach
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
Tao Shu, Marwan Krunz
126
Voted
CN
2004
150views more  CN 2004»
15 years 4 months ago
Optimizing interconnection policies
There are two basic types of interconnection agreements between providers in the Internet: peering and transit. A decision every Internet network service provider (INSP) has to ma...
Oliver Heckmann, Jens Schmitt, Ralf Steinmetz
TON
2002
112views more  TON 2002»
15 years 3 months ago
Pricing in multiservice loss networks: static pricing, asymptotic optimality, and demand substitution effects
We consider a communication network with fixed routing that can accommodate multiple service classes, differing in bandwidth requirements, demand pattern, call duration, and routin...
Ioannis Ch. Paschalidis, Yong Liu