Sciweavers

4679 search results - page 84 / 936
» Modeling When Connections Are the Problem
Sort
View
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
15 years 6 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
15 years 8 months ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd
SRDS
2006
IEEE
15 years 7 months ago
Reducing the Availability Management Overheads of Federated Content Sharing Systems
We consider the problem of ensuring high data availability in federated content sharing systems. Ideally, such a system would provide high data availability in a device transparen...
Christopher Peery, Thu D. Nguyen, Francisco Matias...
IAT
2008
IEEE
15 years 1 months ago
Planning with iFALCON: Towards A Neural-Network-Based BDI Agent Architecture
This paper presents iFALCON, a model of BDI (beliefdesire-intention) agents that is fully realized as a selforganizing neural network architecture. Based on multichannel network m...
Budhitama Subagdja, Ah-Hwee Tan
CAV
2011
Springer
234views Hardware» more  CAV 2011»
14 years 5 months ago
Resolution Proofs and Skolem Functions in QBF Evaluation and Applications
Abstract. Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the result...
Valeriy Balabanov, Jie-Hong R. Jiang