Sciweavers

1089 search results - page 165 / 218
» Bounds on generalized Frobenius numbers
Sort
View
FORMATS
2005
Springer
14 years 2 months ago
On Optimal Timed Strategies
In this paper, we study timed games played on weighted timed automata. In this context, the reachability problem asks if, given a set T of locations and a cost C, Player 1 has a st...
Thomas Brihaye, Véronique Bruyère, J...
FSTTCS
2005
Springer
14 years 2 months ago
Reachability Analysis of Multithreaded Software with Asynchronous Communication
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, J...
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
14 years 2 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
Hao Yuan, Linji Yang, Erdong Chen
WINE
2005
Springer
118views Economy» more  WINE 2005»
14 years 2 months ago
Nash Equilibria and Dominant Strategies in Routing
Nash equilibria and dominant strategies are two of the major approaches to deal with selfishness in an automated system (AS), where each agent is a selfish entity. In this paper,...
Weizhao Wang, Xiang-Yang Li, Xiaowen Chu