Sciweavers

1723 search results - page 81 / 345
» Cycling in linear programming problems
Sort
View
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
15 years 4 months ago
Fast load balancing via bounded best response
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
Baruch Awerbuch, Yossi Azar, Rohit Khandekar
TASE
2008
IEEE
15 years 3 months ago
New Solution Approaches to the General Single- Machine Earliness-Tardiness Problem
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
Hoksung Yau, Yunpeng Pan, Leyuan Shi
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
15 years 4 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
130
Voted
UM
2009
Springer
15 years 9 months ago
What Do Academic Users Really Want from an Adaptive Learning System?
When developing an Adaptive Learning System (ALS), users are generally consulted (if at all) towards the end of the development cycle. This can limit users’ feedback to the chara...
Martin Harrigan, Milos Kravcik, Christina Steiner,...
IEAAIE
2005
Springer
15 years 8 months ago
Plan Execution in Dynamic Environments
Abstract. This paper deals with plan execution on agents/robots in highly dynamic environments. Besides a formal semantics of plan execution and a representation of plans as progra...
Gordon Fraser, Gerald Steinbauer, Franz Wotawa