Sciweavers

763 search results - page 110 / 153
» Programming and Planning
Sort
View
COR
2008
88views more  COR 2008»
14 years 12 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
SIGCSE
2008
ACM
162views Education» more  SIGCSE 2008»
14 years 11 months ago
Automatic extraction of notions from course material
Formally defining the knowledge units taught in a course helps instructors ensure a sound coverage of topics and provides an objective basis for comparing the content of two cours...
Michela Pedroni, Manuel Oriol, Bertrand Meyer, Luk...
SQJ
2008
89views more  SQJ 2008»
14 years 11 months ago
Cost estimation for cross-organizational ERP projects: research perspectives
There are many methods for estimating size, effort, schedule and other cost aspects of IS projects, but only one specifically developed for Enterprise Resource Planning (ERP) [67]...
Maya Daneva, Roel Wieringa
ISCI
2007
88views more  ISCI 2007»
14 years 11 months ago
Strategy creation, decomposition and distribution in particle navigation
Strategy planning is crucial to control a group to achieve a number of tasks in a closed area full of obstacles. In this study, genetic programming has been used to evolve rule-ba...
Ulas Beldek, Kemal Leblebicioglu
ICMLA
2009
14 years 9 months ago
Automatic Feature Selection for Model-Based Reinforcement Learning in Factored MDPs
Abstract--Feature selection is an important challenge in machine learning. Unfortunately, most methods for automating feature selection are designed for supervised learning tasks a...
Mark Kroon, Shimon Whiteson