11740 search results - page 289 / 2348 » More Problems in Rewriting |
196
click to vote
ICML
1995
IEEE
16 years 7 months ago
1995
IEEE
Partially observable Markov decision processes (pomdp's) model decision problems in which an agent tries to maximize its reward in the face of limited and/or noisy sensor fee...
178
click to vote
WEA
2007
Springer
16 years 22 days ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
175
click to vote
SYNASC
2005
IEEE
16 years 6 days ago
2005
IEEE
Particle Swarm Optimization (PSO) technique proved its ability to deal with very complicated optimization and search problems. This paper proposes a new particle swarm variant whi...
164
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
215
click to vote
DBSEC
2007
15 years 8 months ago
2007
Abstract. The event-condition-action (ECA) paradigm holds enormous potential in pervasive computing environments. However, the problem of reliable delivery of event data, generated...