Sciweavers

20 search results - page 2 / 4
» Improved Generic Algorithms for Hard Knapsacks
Sort
View
MOR
2002
94views more  MOR 2002»
13 years 5 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
ICES
2007
Springer
70views Hardware» more  ICES 2007»
13 years 7 months ago
Evolutionary Design of Generic Combinational Multipliers Using Development
Combinational multipliers represent a class of circuits that is usually considered to be hard to design by means of the evolutionary techniques. However, experiments conducted unde...
Michal Bidlo
SDM
2009
SIAM
223views Data Mining» more  SDM 2009»
14 years 2 months ago
Context Aware Trace Clustering: Towards Improving Process Mining Results.
Process Mining refers to the extraction of process models from event logs. Real-life processes tend to be less structured and more flexible. Traditional process mining algorithms...
R. P. Jagadeesh Chandra Bose, Wil M. P. van der Aa...
SAC
2006
ACM
13 years 11 months ago
Imprecise RDQL: towards generic retrieval in ontologies using similarity joins
Traditional semantic web query languages support a logicbased access to the semantic web. They offer a retrieval (or reasoning) of data based on facts. On the traditional web and...
Abraham Bernstein, Christoph Kiefer
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
13 years 11 months ago
Approximation algorithms and online mechanisms for item pricing
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
Maria-Florina Balcan, Avrim Blum