Sciweavers

388 search results - page 58 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
CISIS
2009
IEEE
15 years 8 months ago
Multiple-Paths Search with Concurrent Thread Scheduling for Fast AND/OR Tree Search
This paper proposes a fast AND/OR tree search algorithm using a multiple-paths concurrent search method. Conventional heuristic AND/OR tree search algorithms expand nodes in only ...
Fumiyo Takano, Yoshitaka Maekawa, Hironori Kasahar...
IJCAI
2001
15 years 3 months ago
Adaptive Control of Acyclic Progressive Processing Task Structures
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...
Stéphane Cardon, Abdel-Illah Mouaddib, Shlo...
AIPS
2009
15 years 2 months ago
An Optimal Temporally Expressive Planner: Initial Results and Application to P2P Network Optimization
Temporally expressive planning, an important class of temporal planning, has attracted much attention lately. Temporally expressive planning is difficult; few existing planners ca...
Ruoyun Huang, Yixin Chen, Weixiong Zhang
CIKM
2011
Springer
14 years 1 months ago
Towards feature selection in network
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
Quanquan Gu, Jiawei Han
ICCAD
2007
IEEE
86views Hardware» more  ICCAD 2007»
15 years 10 months ago
Stimulus generation for constrained random simulation
Constrained random simulation is the main workhorse in today’s hardware verification flows. It requires the random generation of input stimuli that obey a set of declaratively...
Nathan Kitchen, Andreas Kuehlmann