Sciweavers

1972 search results - page 162 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
INFOCOM
2010
IEEE
15 years 26 days ago
Analyzing Nonblocking Switching Networks using Linear Programming (Duality)
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
Hung Q. Ngo, Atri Rudra, Anh N. Le, Thanh-Nhan Ngu...
AI
1999
Springer
15 years 2 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
ECSQARU
1997
Springer
15 years 6 months ago
Cactus: A Branching-Time Logic Programming Language
Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...
Panos Rondogiannis, Manolis Gergatsoulis, Themis P...
121
Voted
CL
2004
Springer
15 years 2 months ago
A browser for incremental programming
Much of the elegance and power of Smalltalk comes from its programming environment and tools. First introduced more than 20 years ago, the Smalltalk browser enables programmers to...
Nathanael Schärli, Andrew P. Black
COCOA
2008
Springer
15 years 4 months ago
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
Peter Damaschke