12519 search results - page 128 / 2504 » Approximation Problems Categories |
158
click to vote
MP
1998
15 years 6 months ago
1998
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
177
click to vote
ATAL
2009
Springer
16 years 28 days ago
2009
Springer
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
155
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
185
click to vote
CIKM
2009
Springer
16 years 28 days ago
2009
Springer
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
149
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...