1487 search results - page 121 / 298 » The Computational Complexity of Link Building |
150
click to vote
QSHINE
2005
IEEE
15 years 10 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
134
click to vote
CSL
2005
Springer
15 years 10 months ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
172
click to vote
HICSS
2003
IEEE
15 years 9 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
137
click to vote
JASSS
2002
15 years 4 months ago
2002
What is the degree of sophistication that we have to put into the agents in agents based computer simulation models? Should we provide them with a "mind"? The answer ran...
148
click to vote
ICSOC
2005
Springer
15 years 10 months ago
2005
Springer
Grid computing is about allocating distributed collections of resources including computers, storage systems, networks and instruments to form a coherent system devoted to a “vir...