Sciweavers

920 search results - page 103 / 184
» Generating Satisfiable Problem Instances
Sort
View
AI
1998
Springer
15 years 5 months ago
A Heuristic Incremental Modeling Approach to Course Timetabling
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
Don Banks, Peter van Beek, Amnon Meisels
78
Voted
AAAI
1997
15 years 2 months ago
Models of Continual Computation
Automated problem solving is viewed typically as the expenditure of computation to solve one or more problems passed to a reasoning system. In response to each problem received, e...
Eric Horvitz
95
Voted
COMCOM
1999
78views more  COMCOM 1999»
15 years 11 days ago
A complete test sequence using cyclic sequence for conformance testing
We present a problem of commonly used characterization sequences (CS) for the protocol conformance testing and propose a new test sequence to resolve the problem. The proposed tes...
DaeHun Nyang, S. Y. Lim, JooSeok Song
98
Voted
ICRA
1999
IEEE
146views Robotics» more  ICRA 1999»
15 years 5 months ago
Planning Tracking Motions for an Intelligent Virtual Camera
We consider the problem of automatically generating viewpoint motions for a virtual camera tracking a moving target. Given the target's trajectory, we plan the motion of a ca...
Tsai-Yen Li, Tzong-Hann Yu
ICALP
2003
Springer
15 years 6 months ago
Algorithmic Aspects of Bandwidth Trading
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph ...