Sciweavers

260 search results - page 13 / 52
» Hardness of Parameterized Resolution
Sort
View
MICCAI
2006
Springer
14 years 8 months ago
Fiber Bundle Estimation and Parameterization
Individual white matter fibers cannot be resolved by current magnetic resonance (MR) technology. Many fibers of a fiber bundle will pass through an individual volume element (voxel...
Marc Niethammer, Sylvain Bouix, Carl-Fredrik Westi...
ECRTS
1999
IEEE
13 years 12 months ago
Scheduling coprocessor for enhanced least-laxity-first scheduling in hard real-time systems
Scheduling time impact on system performance increases especially when using dynamic priority algorithms, because of the enlarged computational effort at runtime. This overhead ca...
Jens Hildebrandt, Frank Golatowski, Dirk Timmerman...
COCO
2008
Springer
88views Algorithms» more  COCO 2008»
13 years 9 months ago
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
Kord Eickmeyer, Martin Grohe, Magdalena Grübe...
FM
2008
Springer
93views Formal Methods» more  FM 2008»
13 years 9 months ago
Finding Minimal Unsatisfiable Cores of Declarative Specifications
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
Emina Torlak, Felix Sheng-Ho Chang, Daniel Jackson
OOPSLA
2010
Springer
13 years 5 months ago
A recommender for conflict resolution support in optimistic model versioning
The usage of optimistic version control systems comes along with cumbersome and time-consuming conflict resolution in the case that the modifications of two developers are contrad...
Petra Brosch, Martina Seidl, Gerti Kappel