9842 search results - page 250 / 1969 » Problem complexity |
181
click to vote
CATA
2004
15 years 8 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
134
click to vote
AAAI
1998
15 years 8 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
151
click to vote
ECIS
2003
2003
Work practice characteristics: a framework for understanding complex issues of groupware integration
15 years 8 months ago
Integrating groupware in work practices poses a range of interrelated problems comprising organisational and technological issues. These are complex issues, since they derive from...
181
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
169
click to vote
ICC
2007
IEEE
16 years 29 days ago
2007
IEEE
— We consider opportunistic spectrum access (OSA) which allows secondary users to identify and exploit instantaneous spectrum opportunities resulting from the bursty traffic of ...