8512 search results - page 1446 / 1703 » Computing Theory With Relevance |
204
Voted
FOIKS
2008
Springer
15 years 8 months ago
2008
Springer
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
171
click to vote
IMC
2007
ACM
15 years 8 months ago
2007
ACM
Entropy has recently gained considerable significance as an important metric for network measurement. Previous research has shown its utility in clustering traffic and detecting ...
160
click to vote
BCSHCI
2007
15 years 8 months ago
2007
The landscape of interactive technology design and evaluation is expanding. In the past, usability and task efficiency were the main focus for research in human computer interacti...
176
click to vote
DAGSTUHL
2010
15 years 8 months ago
2010
Visualizations are well suited to communicate large amounts of complex data. With increasing resolution in the spatial and temporal domain simple imaging techniques meet their lim...
174
click to vote
CSC
2008
15 years 8 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...