65 search results - page 7 / 13 » Generating and measuring instances of hard semidefinite prog... |
AAAI
2000
13 years 8 months ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
IWPC
1996
IEEE
13 years 11 months ago
1996
IEEE
Mastering the complexity of programs and systems, particularly distributed systems, should lead to signi cant improvements in program and system understanding. In this paper we pr...
SIGSOFT
2005
ACM
14 years 8 months ago
2005
ACM
There is an increasing interest in techniques that support measurement and analysis of fielded software systems. One of the main goals of these techniques is to better understand ...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Motivated by the ability of living cells to form specific shapes and structures, we present a computational approach using distributed genetic programming to discover cell-cell i...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...