Sciweavers

2747 search results - page 28 / 550
» Non-oblivious Strategy Improvement
Sort
View
74
Voted
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
15 years 3 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
92
Voted
CORR
2011
Springer
164views Education» more  CORR 2011»
14 years 1 months ago
Online Strategies for Intra and Inter Provider Service Migration in Virtual Networks
Network virtualization allows one to build dynamic distributed systems in which resources can be dynamically allocated at locations where they are most useful. In order to fully e...
Dushyant Arora, Marcin Bienkowski, Anja Feldmann, ...
IPPS
2007
IEEE
15 years 4 months ago
Miss Ratio Improvement For Real-Time Applications Using Fragmentation-Aware Placement
Partially reconfigurable Field-Programmable Gate Arrays (FPGAs) allow parts of the chip to be configured at run-time where each part could hold an independent task. Online place...
Ahmed Abou ElFarag, Hatem M. El-Boghdadi, Samir I....
66
Voted
COCOA
2009
Springer
15 years 4 months ago
Improved Bounds for Facility Location Games with Fair Cost Allocation
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
Thomas Dueholm Hansen, Orestis Telelis
93
Voted
EVOW
2004
Springer
15 years 3 months ago
Improving Edge Recombination through Alternate Inheritance and Greedy Manner
Genetic Algorithms (GAs) are well-known heuristic algorithms and have been widely applied to solve combinatorial problems. Edge recombination is one of the famous crossovers design...
Chuan-Kang Ting