1547 search results - page 50 / 310 » Solving Knapsack Problems in a Sticker Based Model |
140
Voted
ACL
2010
15 years 13 days ago
2010
This paper presents a probabilistic model for sense disambiguation which chooses the best sense based on the conditional probability of sense paraphrases given a context. We use a...
131
click to vote
EOR
2007
15 years 2 months ago
2007
: 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...
108
click to vote
COMPSAC
2008
IEEE
15 years 9 months ago
2008
IEEE
Commercial-off-the-shelf components (COTS) are widely reused at present and black-box composition is the unique way to integrate them into the target system. However, various mism...
106
click to vote
ICPR
2010
IEEE
15 years 9 months ago
2010
IEEE
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
121
click to vote
BPM
2006
Springer
15 years 6 months ago
2006
Springer
A framework for modeling Semantic Web Service is proposed. It is based on Description Logic (DL), hence it is endowed with a formal semantics and, in addition, it allows for expres...