Sciweavers

17789 search results - page 3521 / 3558
» Exceptional Use Cases
Sort
View
MP
2002
143views more  MP 2002»
13 years 7 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck
PAMI
1998
116views more  PAMI 1998»
13 years 7 months ago
Scale-Space Derived From B-Splines
—It is well-known that the linear scale-space theory in computer vision is mainly based on the Gaussian kernel. The purpose of the paper is to propose a scale-space theory based ...
Yu-Ping Wang, Seng Luan Lee
SIAMCOMP
1998
138views more  SIAMCOMP 1998»
13 years 7 months ago
Dynamic Trees and Dynamic Point Location
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
Michael T. Goodrich, Roberto Tamassia
SIAMCOMP
1998
118views more  SIAMCOMP 1998»
13 years 7 months ago
Genericity, Randomness, and Polynomial-Time Approximations
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
Yongge Wang
SAC
2002
ACM
13 years 7 months ago
Semi-automatic design of agent organisations
Designing realistic multi-agent systems is a complex process, which involves specifying not only the functionality of individual agents, but also the authority relationships and l...
Anthony Karageorgos, Simon G. Thompson, Nikolay Me...
« Prev « First page 3521 / 3558 Last » Next »