Sciweavers

1236 search results - page 223 / 248
» Prefix-Like Complexities and Computability in the Limit
Sort
View
AIPS
2008
15 years 2 days ago
Bounded-Parameter Partially Observable Markov Decision Processes
The POMDP is considered as a powerful model for planning under uncertainty. However, it is usually impractical to employ a POMDP with exact parameters to model precisely the real-...
Yaodong Ni, Zhi-Qiang Liu
CIKM
2008
Springer
14 years 11 months ago
Scaling up duplicate detection in graph data
Duplicate detection determines different representations of realworld objects in a database. Recent research has considered the use of relationships among object representations t...
Melanie Herschel, Felix Naumann
ASPDAC
2005
ACM
102views Hardware» more  ASPDAC 2005»
14 years 11 months ago
A framework for automated and optimized ASIP implementation supporting multiple hardware description languages
— Architecture Description Languages (ADLs) are widely used to perform design space exploration for Application Specific Instruction Set Processors (ASIPs). While the design spa...
Oliver Schliebusch, Anupam Chattopadhyay, David Ka...
ICALP
2010
Springer
14 years 11 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
APVIS
2001
14 years 11 months ago
Rapid Assembly and Deployment of Domain Visualisation Solutions
Information visualisation exploits the natural perceptual capabilities of the decisionfacilitate the rapid assimilation and analysis of abstract, complex and often voluminous info...
Tim Pattison, Rudi Vernik, Daniel Goodburn, Matthe...