Sciweavers

2925 search results - page 38 / 585
» Information Complexity of Online Problems
Sort
View
IPPS
1998
IEEE
15 years 10 months ago
Fault-Tolerant Message Routing for Multiprocessors
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
Lev Zakrevski, Mark G. Karpovsky
IPPS
2003
IEEE
15 years 11 months ago
MUSE: A Software Oscilloscope for Clusters and Grids
Oscilloscopes and their cousins, logic analyzers, are the tools of choice for difficult electronic hardware problems. In the hands of a skilled engineer or technician, these tool...
Mark K. Gardner, Michael Broxton, Adam Engelhart, ...
SCHEDULING
2008
89views more  SCHEDULING 2008»
15 years 5 months ago
On-line decision support for take-off runway scheduling with uncertain taxi times at London Heathrow airport
: This paper addresses the challenge of building an automated decision support methodology to tackle the complex problem faced every day by runway controllers at London Heathrow Ai...
Jason A. D. Atkin, Edmund K. Burke, John S. Greenw...
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 10 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
SIGUCCS
2004
ACM
15 years 11 months ago
Online solutions: looking to the future of knowledgeBase management
The Princeton University Help Desk KnowledgeBase (KB) is a searchable online information system that publishes Princetonspecific computer solutions to better serve the University ...
Annie Saunders