6740 search results - page 1157 / 1348 » An s -Hamiltonian Line Graph Problem |
121
click to vote
AAAI
1998
15 years 5 months ago
1998
We describe a general approach to optimization which we term Squeaky Wheel" Optimization SWO. In SWO, a greedy algorithm is used to construct a solution which is then analyze...
141
click to vote
UAI
2003
15 years 5 months ago
2003
Continuous time Bayesian networks (CTBN) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cycli...
150
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
139
click to vote
DAGSTUHL
1996
15 years 5 months ago
1996
A supercompiler is a program which can performa deep transformation of programsusing a principle which is similarto partial evaluation, and can be referred to as metacomputation. ...
130
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...