358 search results - page 1 / 72 » Report on Generic Case Complexity |
CORR
2007
Springer
13 years 4 months ago
2007
Springer
CORR
2008
Springer
13 years 4 months ago
2008
Springer
SIAMCOMP
1998
13 years 4 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
VISUALIZATION
2003
IEEE
13 years 10 months ago
2003
IEEE
We describe how to count the cases that arise in a family of visualization techniques, including Marching Cubes, Sweeping Simplices, Contour Meshing, Interval Volumes, and Separat...
CAEPIA
2003
Springer
13 years 10 months ago
2003
Springer
This paper describes how agent and knowledge technology can be used to build advanced software systems that support operational decisionn complex domains. In particular, we present...