176 search results - page 7 / 36 » heuristics 1998 |
ASPDAC
1998
ACM
15 years 8 months ago
1998
ACM
—An AND-OR-EXOR network, where the output EXOR gate has only two inputs, is one of the simplest three-level architecture. This network realizes an EXOR of two sum-of-products exp...
136
click to vote
AI
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
122
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
150
click to vote
WSC
2000
15 years 5 months ago
2000
We compare the performance of five well-known truncation heuristics for mitigating the effects of initialization bias in the output analysis of steady-state simulations. Two of th...
120
click to vote
COMBINATORICS
1998
15 years 4 months ago
1998
New lower bounds for 15 classical Ramsey numbers are established. Several of the colorings are found using a new variation of local search heuristics. Several others are found usi...