Sciweavers

940 search results - page 170 / 188
» Control Abstractions for Local Search
Sort
View
EVOW
2009
Springer
13 years 6 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
RSP
2005
IEEE
164views Control Systems» more  RSP 2005»
14 years 2 months ago
High Level Synthesis for Data-Driven Applications
Abstract— John von Neumann proposed his famous architecture in a context where hardware was very expensive and bulky. His goal was to maximize functionality with minimal hardware...
Etienne Bergeron, Xavier Saint-Mleux, Marc Feeley,...
WIOPT
2010
IEEE
13 years 6 months ago
Resource allocation for cross-layer utility maximization in multi-hop wireless networks in the presence of self interference
Abstract—The cross-layer utility maximization problem subject to stability constraints is considered for a multi-hop wireless network. A time slotted network, where the channel g...
Chathuranga Weeraddana, Marian Codreanu, Matti Lat...
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
14 years 2 months ago
Solving real-valued optimisation problems using cartesian genetic programming
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
James Alfred Walker, Julian Francis Miller
ISCC
2006
IEEE
112views Communications» more  ISCC 2006»
14 years 2 months ago
The Precision and Energetic Cost of Snapshot Estimates in Wireless Sensor Networks
— Even for a specific application, the design space of wireless sensor networks is enormous, and traditional disciplinary boundaries are disappearing in the search for efficien...
Paul G. Flikkema