Sciweavers

8496 search results - page 257 / 1700
» Problem Solving and Complex Systems
Sort
View
93
Voted
EOR
2006
87views more  EOR 2006»
15 years 2 months ago
Applying machine based decomposition in 2-machine flow shops
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
Saral Mukherjee, A. K. Chatterjee
97
Voted
CDC
2009
IEEE
156views Control Systems» more  CDC 2009»
15 years 7 months ago
The nullspace method - a unifying paradigm to fault detection
— The nullspace method is a powerful framework to solve the synthesis problem of fault detection filters in the most general setting. It is also well suited to address the least...
András Varga
142
Voted
MATES
2009
Springer
15 years 9 months ago
Concurrently Decomposable Constraint Systems
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
Cees Witteveen, Wiebe van der Hoek, Nico Roos
111
Voted
SIGCSE
2006
ACM
128views Education» more  SIGCSE 2006»
15 years 8 months ago
Turning automata theory into a hands-on course
We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are te...
Susan H. Rodger, Bart Bressler, Thomas Finley, Ste...
118
Voted
AAAI
2008
15 years 5 months ago
Reducing Particle Filtering Complexity for 3D Motion Capture using Dynamic Bayesian Networks
Particle filtering algorithms can be used for the monitoring of dynamic systems with continuous state variables and without any constraints on the form of the probability distribu...
Cédric Rose, Jamal Saboune, François...