Sciweavers

9325 search results - page 209 / 1865
» The decentralized implementability problem
Sort
View
ISCIS
2005
Springer
15 years 8 months ago
An Investigation of the Course-Section Assignment Problem
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
Zeki Bayram
DATE
1997
IEEE
80views Hardware» more  DATE 1997»
15 years 7 months ago
Hybrid symbolic-explicit techniques for the graph coloring problem
This paper presents an algorithmic technique based on hybridizing Symbolic Manipulation Techniques based on BDDs with more traditional Explicit solving algorithms. To validate the...
Silvia Chiusano, Fulvio Corno, Paolo Prinetto, Mat...
AIPS
2010
15 years 5 months ago
Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approa...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
ICMLA
2007
15 years 4 months ago
Learning complex problem solving expertise from failures
Our research addresses the issue of developing knowledge-based agents that capture and use the problem solving knowledge of subject matter experts from diverse application domains...
Cristina Boicu, Gheorghe Tecuci, Mihai Boicu
ICCAD
2001
IEEE
95views Hardware» more  ICCAD 2001»
16 years 5 days ago
On the Signal Bounding Problem in Timing Analysis
In this paper, we study the propagation of slew dependent bounding signals and the corresponding slew problem in static timing analysis. The selection of slew from the latest arri...
Jin-fuw Lee, Daniel L. Ostapko, Jeffery Soreff, C....