8496 search results - page 193 / 1700 » Problem Solving and Complex Systems |
TCS
2010
13 years 8 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
WINE
2005
Springer
14 years 3 months ago
2005
Springer
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...
IEAAIE
2004
Springer
14 years 3 months ago
2004
Springer
A fundamental difficulty faced by cooperative multiagent systems is to find how to efficiently coordinate agents. There are three fundamental processes to solve the coordination pr...
AIEDAM
2008
13 years 9 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
ISF
2007
13 years 9 months ago
2007
This article discusses methods to support assurance of surveillance monitoring; and compliance verification knowledge management (CV-KM). The discussion includes aspects of primar...