Sciweavers

3220 search results - page 609 / 644
» Constrained Graph Processes
Sort
View
EPS
1998
Springer
15 years 1 months ago
Variable-Dimensional Optimization with Evolutionary Algorithms Using Fixed-Length Representations
This paper discusses a simple representation of variable-dimensional optimization problems for evolutionary algorithms. Although it was successfully applied to the optimization of ...
Joachim Sprave, Susanne Rolf
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 1 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
CGO
2009
IEEE
15 years 1 months ago
Communication-Sensitive Static Dataflow for Parallel Message Passing Applications
Message passing is a very popular style of parallel programming, used in a wide variety of applications and supported by many APIs, such as BSD sockets, MPI and PVM. Its importance...
Greg Bronevetsky
CIKM
2007
Springer
15 years 1 months ago
A fast unified optimal route query evaluation algorithm
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
Edward P. F. Chan, Jie Zhang
AIPS
2007
15 years 1 days ago
Learning to Plan Using Harmonic Analysis of Diffusion Models
This paper summarizes research on a new emerging framework for learning to plan using the Markov decision process model (MDP). In this paradigm, two approaches to learning to plan...
Sridhar Mahadevan, Sarah Osentoski, Jeffrey Johns,...