Sciweavers

315 search results - page 7 / 63
» Shortest path optimization under limited information
Sort
View
IEEEMSP
2002
IEEE
14 years 24 days ago
An optimal shape encoding scheme using skeleton decomposition
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
14 years 1 months ago
Limits in Long Path Learning with XCS
The development of the XCS Learning Classifier System [26] has produced a stable implementation, able to consistently identify the accurate and optimally general population of cla...
Alwyn Barry
QOSIP
2005
Springer
14 years 1 months ago
Optimizing Routing Decisions Under Inaccurate Network State Information
Abstract. Maintaining accurate network state information in the Traffic Engineering Databases of each node along a network is extremely difficult. The BYPASS Based Routing (BBR) me...
Xavier Masip-Bruin, Sergio Sánchez-Ló...
ER
2008
Springer
110views Database» more  ER 2008»
13 years 9 months ago
Conjunctive Query Containment under Access Limitations
Access limitations may occur when querying data sources over the web or heterogeneous data sources presented as relational tables: this happens, for instance, in Data Exchange and ...
Andrea Calì, Davide Martinenghi
JCO
2006
106views more  JCO 2006»
13 years 7 months ago
Reliable Ad Hoc Routing Based on Mobility Prediction
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...
Jian Tang, Guoliang Xue, Weiyi Zhang