Sciweavers

537 search results - page 30 / 108
» Problems from CGCS Luminy, May 2007
Sort
View
EOR
2007
111views more  EOR 2007»
14 years 11 months ago
Linear programming based algorithms for preemptive and non-preemptive RCPSP
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
Jean Damay, Alain Quilliot, Eric Sanlaville
CCCG
2007
15 years 19 days ago
Covering Points by Isothetic Unit Squares
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, S...
EMNLP
2004
15 years 17 days ago
Trained Named Entity Recognition using Distributional Clusters
This work applies boosted wrapper induction (BWI), a machine learning algorithm for information extraction from semi-structured documents, to the problem of named entity recogniti...
Dayne Freitag
IJCAI
1989
15 years 10 days ago
On Cooperation in a Multi-Entity Model
The problem of modeling a variety of domains within the framework of one general scheme is of central importance in AI. This paper presents the MultiEntity model for multi-agent p...
Moshe Tennenholtz, Yoram Moses
APIN
1998
132views more  APIN 1998»
14 years 11 months ago
Evolution-Based Methods for Selecting Point Data for Object Localization: Applications to Computer-Assisted Surgery
Object localization has applications in many areas of engineering and science. The goal is to spatially locate an arbitrarily-shaped object. In many applications, it is desirable ...
Shumeet Baluja, David Simon