Sciweavers

14649 search results - page 272 / 2930
» Principles of problem solving
Sort
View
IAT
2005
IEEE
16 years 6 days ago
Decomposition Techniques for a Loosely-Coupled Resource Allocation Problem
We are interested by contributing to stochastic problems of which the main distinction is that some tasks may create other tasks. In particular, we present a first approach which...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
16 years 3 days ago
Evolutionary optimization of dynamic control problems accelerated by progressive step reduction
In this paper, we describe the use of an evolutionary algorithm (EA) to solve dynamic control optimization problems in engineering. In this class of problems, a set of control var...
Q. Tuan Pham
STACS
2005
Springer
16 years 2 days ago
Exact Quantum Algorithms for the Leader Election Problem
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumot...
DATE
1997
IEEE
80views Hardware» more  DATE 1997»
15 years 10 months ago
Hybrid symbolic-explicit techniques for the graph coloring problem
This paper presents an algorithmic technique based on hybridizing Symbolic Manipulation Techniques based on BDDs with more traditional Explicit solving algorithms. To validate the...
Silvia Chiusano, Fulvio Corno, Paolo Prinetto, Mat...
CORR
1999
Springer
145views Education» more  CORR 1999»
15 years 6 months ago
Subgraph Isomorphism in Planar Graphs and Related Problems
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
David Eppstein