Sciweavers

2266 search results - page 52 / 454
» Some Solutions to the Ignoring Problem
Sort
View
ICALP
2010
Springer
15 years 6 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
AIR
2005
98views more  AIR 2005»
15 years 1 months ago
Evolving Dynamic Multi-Objective Optimization Problems with Objective Replacement
This paper studies the strategies for multi-objective optimization in a dynamic environment. In particular, we focus on problems with objective replacement, where some objectives ...
Sheng Uei Guan, Qian Chen, Wenting Mo
SAJ
2000
80views more  SAJ 2000»
15 years 1 months ago
Handling diversity in group Work in the information systems class
Tertiary institutions in South Africa are faced with dealing with diversity in all its forms in our classrooms. Information Systems, Information Technology and Computer Science st...
T. Thomas, C. De Villiers
CP
2005
Springer
15 years 7 months ago
Caching Search States in Permutation Problems
When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment wil...
Barbara M. Smith
AAIM
2006
Springer
222views Algorithms» more  AAIM 2006»
15 years 7 months ago
Connected Set Cover Problem and Its Applications
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
Tianping Shuai, Xiao-Dong Hu