Sciweavers

9842 search results - page 1389 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
INFOCOM
2003
IEEE
16 years 14 days ago
Pseudo Likelihood Estimation in Network Tomography
Abstract— Network monitoring and diagnosis are key to improving network performance. The difficulties of performance monitoring lie in today’s fast growing Internet, accompani...
Gang Liang, Bin Yu
SIGECOM
2003
ACM
110views ECommerce» more  SIGECOM 2003»
16 years 13 days ago
Virtual worlds: fast and strategyproof auctions for dynamic resource allocation
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
Chaki Ng, David C. Parkes, Margo I. Seltzer
SPAA
2003
ACM
16 years 13 days ago
Throughput-centric routing algorithm design
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
Brian Towles, William J. Dally, Stephen P. Boyd
AI
2003
Springer
16 years 13 days ago
Case Authoring from Text and Historical Experiences
The problem of repair and maintenance of complex systems, such as aircraft, cars and trucks is certainly a nontrivial task. Maintenance technicians must use a great amount of knowl...
Marvin Zaluski, Nathalie Japkowicz, Stan Matwin
EVOW
2003
Springer
16 years 12 days ago
GAME-HDL: Implementation of Evolutionary Algorithms Using Hardware Description Languages
Evolutionary Algorithms (EAs) have been proposed as a very powerful heuristic optimization technique to solve complex problems. Many case studies have shown that they work very eff...
Rolf Drechsler, Nicole Drechsler
« Prev « First page 1389 / 1969 Last » Next »