Sciweavers

1547 search results - page 179 / 310
» Solving Knapsack Problems in a Sticker Based Model
Sort
View
VLDB
2004
ACM
104views Database» more  VLDB 2004»
16 years 3 months ago
Retrieval effectiveness of an ontology-based model for information selection
Technology in the field of digital media generates huge amounts of nontextual information, audio, video, and images, along with more familiar textual information. The potential for...
Latifur Khan, Dennis McLeod, Eduard H. Hovy
135
Voted
WWW
2005
ACM
16 years 4 months ago
On optimal service selection
While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to offers in an optimal way has not yet b...
Piero A. Bonatti, P. Festa
108
Voted
AIPS
2003
15 years 4 months ago
Optimal Rectangle Packing: Initial Results
Given a set of rectangles with fixed orientations, we want to find an enclosing rectangle of minimum area that contains them all with no overlap. Many simple scheduling tasks ca...
Richard E. Korf
153
Voted
ICML
1995
IEEE
16 years 4 months ago
Learning Policies for Partially Observable Environments: Scaling Up
Partially observable Markov decision processes (pomdp's) model decision problems in which an agent tries to maximize its reward in the face of limited and/or noisy sensor fee...
Michael L. Littman, Anthony R. Cassandra, Leslie P...
ASPDAC
2009
ACM
161views Hardware» more  ASPDAC 2009»
15 years 10 months ago
Risk aversion min-period retiming under process variations
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
Jia Wang, Hai Zhou