270 search results - page 9 / 54 » Dynamic Complexity Theory Revisited |
EOR
2008
14 years 11 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
118
click to vote
FLAIRS
2008
15 years 2 months ago
2008
As a side effect of e-marketing strategy the number of spam e-mails is rocketing, the time and cost needed to deal with spam as well. Spam filtering is one of the most difficult t...
ICALP
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
104
click to vote
ECAL
2007
Springer
15 years 5 months ago
2007
Springer
The “order for free” exhibited by some classes of system has been exploited by natural selection in order to build systems capable of exhibiting complex behaviour. Here we expl...
IAT
2009
IEEE
15 years 6 months ago
2009
IEEE
Training systems with intelligent virtual agents provide an effective means to train people for complex, dynamic tasks like crisis management or firefighting. Virtual agents pro...