Sciweavers

5316 search results - page 73 / 1064
» Which Search Problems Are Random
Sort
View
CP
1998
Springer
15 years 7 months ago
Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units
A well-studied problem in the electric power industry is that of optimally scheduling preventative maintenance of power generating units within a power plant. We show how these pr...
Daniel Frost, Rina Dechter
IJCAI
1989
15 years 4 months ago
Preprocessing Search Spaces for Branch and Bound Search
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
Qiang Yang, Dana S. Nau
PATAT
2004
Springer
151views Education» more  PATAT 2004»
15 years 8 months ago
Decomposition and Parallelization of Multi-resource Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of ...
Petr Slechta
AIMSA
2008
Springer
15 years 9 months ago
Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
Zhipeng Lü, Jin-Kao Hao
IJNSEC
2008
132views more  IJNSEC 2008»
15 years 3 months ago
An Authenticated Key Agreement Protocol Using Conjugacy Problem in Braid Groups
In this paper we propose an authenticated key agreement, which works in a braid group. We prove that our protocol meet the security attributes under the assumption that the Conjug...
Atul Chaturvedi, Sunder Lal