Sciweavers

4325 search results - page 486 / 865
» Incremental computation with names
Sort
View
ESWA
2010
101views more  ESWA 2010»
15 years 5 months ago
A note on the truck and trailer routing problem
This study considers a relaxation of the truck and trailer routing problem (TTRP), called the relaxed truck and trailer routing problem (RTTRP). In the TTRP, the number of availab...
Shih-Wei Lin, Vincent F. Yu, Shuo-Yan Chou
MP
2010
116views more  MP 2010»
15 years 5 months ago
Separation algorithms for 0-1 knapsack polytopes
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
Konstantinos Kaparis, Adam N. Letchford
173
Voted
SYNTHESE
2010
130views more  SYNTHESE 2010»
15 years 5 months ago
Belief ascription under bounded resources
There exists a considerable body of work on epistemic logics for resource-bounded reasoners. In this paper, we concentrate on a less studied aspect of resource-bounded reasoning, n...
Natasha Alechina, Brian Logan
VTC
2010
IEEE
150views Communications» more  VTC 2010»
15 years 5 months ago
Path Selection Algorithms for Multi-Hop VANETs
—In this paper, we introduce a collision model for vehicular cluster and we propose path selection algorithms for multi-hop VANETs. That is, we propose the intuitive algorithm na...
Chulhee Jang, Jae Hong Lee
ASPDAC
2010
ACM
119views Hardware» more  ASPDAC 2010»
15 years 4 months ago
VISA: versatile impulse structure approximation for time-domain linear macromodeling
Abstract-- We develop a rational function macromodeling algorithm named VISA (Versatile Impulse Structure Approximation) for macromodeling of system responses with (discrete) time-...
Chi-Un Lei, Ngai Wong