Sciweavers

861 search results - page 54 / 173
» Polymorphic Time Systems for Estimating Program Complexity
Sort
View
ACL
2009
13 years 7 months ago
Non-Projective Dependency Parsing in Expected Linear Time
We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order o...
Joakim Nivre
SEMWEB
2009
Springer
14 years 3 months ago
Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...
Ken Kaneiwa, Philip H. P. Nguyen
ISORC
2008
IEEE
14 years 3 months ago
Usability Aspects of WCET Analysis
Knowing the program timing characteristics is fundamental to the successful design and execution of real-time systems. A critical timing measure is the worst-case execution time (...
Jan Gustafsson
IEEECIT
2006
IEEE
14 years 3 months ago
The Partitioning Methodology in Hardware/Software Co-Design Using Extreme Programming: Evaluation through the Lego Robot Project
This paper argues about the partitioning in hardware/software co-design and suggests the methodology applying extreme programming to complement the co-design. This approach, contr...
Heeseo Chae, Dong-hyun Lee, Jiyong Park, Hoh Peter...
CCGRID
2007
IEEE
14 years 3 months ago
Reparallelization and Migration of OpenMP Programs
Typical computational grid users target only a single cluster and have to estimate the runtime of their jobs. Job schedulers prefer short-running jobs to maintain a high system ut...
Michael Klemm, Matthias Bezold, Stefan Gabriel, Ro...