Sciweavers

1884 search results - page 62 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
NMA
2010
14 years 8 months ago
Genetic Algorithms Based Parameter Identification of Yeast Fed-Batch Cultivation
Different kinds of genetic algorithms have been investigated for a parameter identification of a fermentation process. Altogether eight realizations of genetic algorithms have been...
Maria Angelova, Stoyan Tzonkov, Tania Pencheva
APLAS
2009
ACM
15 years 4 months ago
Large Spurious Cycle in Global Static Analyses and Its Algorithmic Mitigation
We present a simple algorithmic extension of the classical call-strings approach to mitigate substantial performance degradation caused by spurious interprocedural cycles. Spuriou...
Hakjoo Oh
FOCS
1999
IEEE
15 years 2 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
DATE
1997
IEEE
89views Hardware» more  DATE 1997»
15 years 2 months ago
Cone-based clustering heuristic for list-scheduling algorithms
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
Sriram Govindarajan, Ranga Vemuri
CSR
2009
Springer
15 years 4 months ago
New Plain-Exponential Time Classes for Graph Homomorphism
A homomorphism from a graph G to a graph H (in this paper, both simple, undirected graphs) is a mapping f : V (G) → V (H) such that if uv ∈ E(G) then f(u)f(v) ∈ E(H). The pro...
Magnus Wahlström