Sciweavers

4934 search results - page 323 / 987
» complexity 2008
Sort
View
JOT
2008
142views more  JOT 2008»
15 years 6 months ago
cmUML - A UML based Framework for Formal Specification of Concurrent, Reactive Systems
Complex software systems possess concurrent and reactive behaviors requiring precise specifications prior to development. Lamport's transition axiom method is a formal specif...
Jagadish Suryadevara, Lawrence Chung, R. K. Shyama...
DISOPT
2007
81views more  DISOPT 2007»
15 years 6 months ago
Strong polynomiality of resource constraint propagation
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....
Luc Mercier, Pascal Van Hentenryck
TON
2002
99views more  TON 2002»
15 years 6 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
TALG
2008
97views more  TALG 2008»
15 years 6 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon
CEC
2008
IEEE
16 years 1 months ago
Solving large scale global optimization using improved Particle Swarm Optimizer
—As more and more real-world optimization problems become increasingly complex, algorithms with more capable optimizations are also increasing in demand. For solving large scale ...
Sheng-Ta Hsieh, Tsung-Ying Sun, Chan-Cheng Liu, Sh...