400 search results - page 8 / 80 » What Makes a Problem GP-Hard |
IMC
2010
ACM
13 years 5 months ago
2010
ACM
Router syslogs are messages that a router logs to describe a wide range of events observed by it. They are considered one of the most valuable data sources for monitoring network ...
SIGIR
2006
ACM
14 years 1 months ago
2006
ACM
In today’s data-rich networked world, people express many aspects of their lives online. It is common to segregate different aspects in different places: you might write opinion...
GRID
2003
Springer
14 years 18 days ago
2003
Springer
Computational Grids have the potential to become the main execution platform for high performance and distributed applications. However, such systems are extremely complex and pro...
COCO
1995
Springer
13 years 11 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
EVOW
2004
Springer
13 years 11 months ago
2004
Springer
This paper presents an attempt to find a statistical model that predicts the hardness of the University Course Timetabling Problem by analyzing instance properties. The model may l...