Sciweavers

1258 search results - page 40 / 252
» Architecture-driven Problem Decomposition
Sort
View
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
14 years 3 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul
SAC
2006
ACM
14 years 3 months ago
Spatial geometric constraint solving based on k-connected graph decomposition
We propose a geometric constraint solving method based on connectivity analysis in graph theory, which can be used to decompose a well-constrained problem into some smaller ones i...
Gui-Fang Zhang, Xiao-Shan Gao
CORR
2007
Springer
147views Education» more  CORR 2007»
13 years 9 months ago
Decomposition During Search for Propagation-Based Constraint Solvers
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Martin Mann, Guido Tack, Sebastian Will
EMNLP
2010
13 years 7 months ago
On Dual Decomposition and Linear Programming Relaxations for Natural Language Processing
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracl...
Alexander M. Rush, David Sontag, Michael Collins, ...
CEC
2009
IEEE
14 years 4 months ago
Task decomposition and evolvability in intrinsic evolvable hardware
— Many researchers have encountered the problem that the evolution of electronic circuits becomes exponentially more difficult when problems with an increasing number of outputs...
Tüze Kuyucu, Martin Trefzer, Julian Francis M...