Sciweavers

697 search results - page 77 / 140
» On the Theory of Average Case Complexity
Sort
View
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
14 years 2 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
ESAW
2004
Springer
14 years 1 months ago
Managing Conflicts Between Individuals and Societies in Multi-agent Systems
The development of multi-agent systems (MAS) implies considering both the social and individual levels of these systems. However, the elements in these levels are not necessarily c...
Rubén Fuentes, Jorge J. Gómez-Sanz, ...
SIGMOD
2010
ACM
259views Database» more  SIGMOD 2010»
14 years 23 days ago
PODS: a new model and processing algorithms for uncertain data streams
Uncertain data streams, where data is incomplete, imprecise, and even misleading, have been observed in many environments. Feeding such data streams to existing stream systems pro...
Thanh T. L. Tran, Liping Peng, Boduo Li, Yanlei Di...
MC
2001
116views Computer Science» more  MC 2001»
13 years 9 months ago
Emotions and Multimodal Interface-Agents: A Sociological View
Designing human-computer interfaces that are easy and intuitive to use is important for the use of computer technology in general. Due to the growing complexity of information sys...
Daniel Moldt, Christian von Scheve
EOR
2007
102views more  EOR 2007»
13 years 8 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux