1095 search results - page 154 / 219 » Preprocessing of Intractable Problems |
TRIER
2002
13 years 10 months ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
SIGMOD
2001
ACM
14 years 10 months ago
2001
ACM
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
BPM
2009
Springer
14 years 5 months ago
2009
Springer
ions in Process Mining: A Taxonomy of Patterns R.P. Jagadeesh Chandra Bose1,2 and Wil M.P. van der Aalst1 1 Department of Mathematics and Computer Science, University of Technology...
LPNMR
2007
Springer
14 years 4 months ago
2007
Springer
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
WIA
2001
Springer
14 years 3 months ago
2001
Springer
This article describes a finite-state cascade for the extraction of person names in texts in French. We extract these proper names in order to categorize and to cluster texts with...