1095 search results - page 28 / 219 » Preprocessing of Intractable Problems |
ICALP
1995
Springer
13 years 11 months ago
1995
Springer
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efï...
CIAC
2010
Springer
13 years 11 months ago
2010
Springer
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
SIPS
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we present a bio-inspired unified model to improve the recognition accuracy of character recognition problems for CAPTCHA (Completely Automated Public Turing Test t...
AI
2006
Springer
13 years 11 months ago
2006
Springer
Real world multiagent coordination problems are important issues for reinforcement learning techniques. In general, these problems are partially observable and this characteristic ...
CDC
2009
IEEE
13 years 8 months ago
2009
IEEE
Many model predictive control (MPC) schemes suffer from high computational complexity. Especially robust MPC schemes, which explicitly account for the effects of disturbances, can ...