1615 search results - page 176 / 323 » Computer science and decision theory |
103
click to vote
STACS
2010
Springer
15 years 7 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
84
Voted
ACMSE
2004
ACM
15 years 6 months ago
2004
ACM
Usability has often been sold as the silver bullet for solving the problems of unprofitable online stores. Although better usability will generally improve these sites and their p...
ACMSE
2000
ACM
15 years 5 months ago
2000
ACM
Scenarios are narratives that illustrate future possibilities, such as proposed systems or plans, and help policy makers and designers choose among alternative courses of action. ...
105
Voted
ACMSE
2009
ACM
15 years 4 months ago
2009
ACM
The convergence of various multimedia communications that includes voice, video and data presents many opportunities for enabling unified communication but paradoxically leads to ...
117
Voted
CAD
2008
Springer
15 years 28 days ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...