Sciweavers

6149 search results - page 878 / 1230
» Revealing the programming process
Sort
View
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
16 years 1 months ago
Eye-tracking evolutionary algorithm to minimize user fatigue in IEC applied to interactive one-max problem
In this paper, we describe a new algorithm that consists in combining an eye-tracker for minimizing the fatigue of a user during the evaluation process of Interactive Evolutionary...
Denis Pallez, Philippe Collard, Thierry Baccino, L...
ICALP
2007
Springer
16 years 1 months ago
Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners
We present a streaming algorithm for constructing sparse spanners and show that our algorithm out-performs significantly the state-of-the-art algorithm for this task [20]. Speci...
Michael Elkin
ICALP
2007
Springer
16 years 1 months ago
On Commutativity Based Edge Lean Search
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...
Dragan Bosnacki, Edith Elkind, Blaise Genest, Doro...
ICN
2007
Springer
16 years 29 days ago
Heuristic Approach of Optimal Code Allocation in High Speed Downlink Packet Access Networks
— In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete ...
Hussein Al-Zubaidy, Jerome Talim, Ioannis Lambadar...
IFIP
2007
Springer
16 years 29 days ago
A Framework for QoS Contract Negotiation in Component-Based Applications
The support of QoS properties in component-based software requires the run-time selection of appropriate concrete QoS contracts at the ports of the interacting components. Such a s...
Mesfin Mulugeta, Alexander Schill