Sciweavers

14739 search results - page 246 / 2948
» An optimization problem on the sphere
Sort
View
IAT
2005
IEEE
15 years 4 months ago
Decomposition Techniques for a Loosely-Coupled Resource Allocation Problem
We are interested by contributing to stochastic problems of which the main distinction is that some tasks may create other tasks. In particular, we present a first approach which...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
GECCO
2003
Springer
15 years 4 months ago
What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes
Abstract. This paper provides an empirical test of a hypothesis, which describes the effects of structural mechanisms in genetic programming. In doing so, the paper offers a test p...
Jason M. Daida, Hsiaolei Li, Ricky Tang, Adam M. H...
COCO
2000
Springer
123views Algorithms» more  COCO 2000»
15 years 3 months ago
A Lower Bound for the Shortest Path Problem
We show that the Shortest Path Problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of t...
Ketan Mulmuley, Pradyut Shah
ISAAC
1999
Springer
107views Algorithms» more  ISAAC 1999»
15 years 3 months ago
Carrying Umbrellas: An Online Relocation Problem on Graphs
We introduce an online relocation problem on a graph, in which a player who walks around the nodes makes decisions on whether to relocate mobile resources, while not knowing the fu...
Jae-Ha Lee, Chong-Dae Park, Kyung-Yong Chwa
ISLPED
1998
ACM
79views Hardware» more  ISLPED 1998»
15 years 3 months ago
Voltage scheduling problem for dynamically variable voltage processors
This paper presents a model of dynamically variable voltage processor and basic theorems for power-delay optimization. A static voltage scheduling problem is also proposed and for...
Tohru Ishihara, Hiroto Yasuura