Sciweavers

4860 search results - page 671 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
ATAL
2007
Springer
16 years 24 days ago
A Q-decomposition and bounded RTDP approach to resource allocation
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
INFOCOM
2005
IEEE
16 years 6 days ago
On static reachability analysis of IP networks
The primary purpose of a network is to provide reachability between applications running on end hosts. In this paper, we describe how to compute the reachability a network provide...
Geoffrey G. Xie, Jibin Zhan, David A. Maltz, Hui Z...
SAC
2005
ACM
16 years 5 days ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
ATAL
2005
Springer
16 years 5 days ago
Evaluating the Minority Game strategy in agent role assignments
A team-based competitive environment is a complex multiagent environment, in which agents are required to coordinate with each other not only to enhance their collective behavior,...
Tingting Wang, Jiming Liu
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
16 years 4 days ago
Incorporating fuzzy knowledge into fitness: multiobjective evolutionary 3D design of process plants
Designing technical plants is a complex and demanding process. It has been shown that the optimization of the simple facility placement problem is already NP-hard. Optimization of...
Ingo Mierswa