Sciweavers

245 search results - page 20 / 49
» Locating phase transitions in computationally hard problems
Sort
View
EOR
2010
119views more  EOR 2010»
13 years 7 months ago
Adaptive Tabu Search for course timetabling
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general frame...
Zhipeng Lü, Jin-Kao Hao
HYBRID
2004
Springer
14 years 26 days ago
Understanding the Bacterial Stringent Response Using Reachability Analysis of Hybrid Systems
Abstract. In this paper we model coupled genetic and metabolic networks as hybrid systems. The vector fields are multi - affine, i.e., have only product - type nonlinearities to a...
Calin Belta, Peter Finin, Luc C. G. J. M. Habets, ...
CIA
2007
Springer
14 years 1 months ago
From Local Search to Global Behavior: Ad Hoc Network Example
We introduce the Consensual N-Player Prisoner’s Dilemma as a large-scale dilemma. We then present a framework for cooperative consensus formation in large-scale MAS under the N-P...
Osher Yadgar
CIKM
2005
Springer
14 years 1 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu
AAAI
1994
13 years 8 months ago
Tractable Planning with State Variables by Exploiting Structural Restrictions
So far, tractable planning problems reported in the literature have been defined by syntactical restrictions. To better exploit the inherent structure in problems, however, it is ...
Peter Jonsson, Christer Bäckström