Sciweavers

2560 search results - page 142 / 512
» Contributions to zero-sum problems
Sort
View
WCRE
1993
IEEE
14 years 2 months ago
A Practical Program Transformation System for Reverse Engineering
Program transformation systems provide one means of formally deriving a program from its speci cation. The main advantage of this development method is that the executable program...
M. Ward, K. Bennett
AIPS
2003
14 years 5 days ago
A Framework for Planning with Extended Goals under Partial Observability
Planning in nondeterministic domains with temporally extended goals under partial observability is one of the most challenging problems in planning. Subsets of this problem have b...
Piergiorgio Bertoli, Alessandro Cimatti, Marco Pis...
FLAIRS
1998
14 years 4 days ago
Analytical Design of Reinforcement Learning Tasks
Reinforcement learning (RL) problems constitute an important class of learning and control problems faced by artificial intelligence systems. In these problems, one is faced with ...
Robert E. Smith
MST
2007
167views more  MST 2007»
13 years 10 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
ICALP
2009
Springer
14 years 11 months ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...