Sciweavers

1539 search results - page 267 / 308
» Is it time for real-time functional programming
Sort
View
ICALP
2009
Springer
14 years 8 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 8 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
DAGM
2003
Springer
14 years 28 days ago
Learning Human-Like Opponent Behavior for Interactive Computer Games
Compared to their ancestors in the early 1970s, present day computer games are of incredible complexity and show magnificent graphical performance. However, in programming intelli...
Christian Bauckhage, Christian Thurau, Gerhard Sag...
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
13 years 11 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
AUTOMATICA
2006
125views more  AUTOMATICA 2006»
13 years 7 months ago
Optimization over state feedback policies for robust control with constraints
This paper is concerned with the optimal control of linear discrete-time systems, which are subject to unknown but bounded state disturbances and mixed constraints on the state an...
Paul J. Goulart, Eric C. Kerrigan, Jan M. Maciejow...