Sciweavers

2925 search results - page 340 / 585
» Information Complexity of Online Problems
Sort
View
ECIS
2003
15 years 6 months ago
Towards an interdisciplinary theory of networks
Research problems in ICT networks often comprise coordination problems of information infrastructures and require state-of-the-art methods of coping with complex system dynamics. ...
Tim Weitzel, Oliver Wendt, Wolfgang König
IJISEC
2006
108views more  IJISEC 2006»
15 years 4 months ago
How to obtain full privacy in auctions
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
Felix Brandt
SAC
2008
ACM
15 years 4 months ago
PHALANX: a graph-theoretic framework for test case prioritization
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...
Murali Krishna Ramanathan, Mehmet Koyutürk, A...
CP
2004
Springer
15 years 10 months ago
Leveraging the Learning Power of Examples in Automated Constraint Acquisition
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
Christian Bessière, Remi Coletta, Eugene C....
142
Voted
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
15 years 9 months ago
Estimating the distribution and propagation of genetic programming building blocks through tree compression
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
Robert I. McKay, Xuan Hoai Nguyen, James R. Cheney...