Sciweavers

895 search results - page 155 / 179
» An Indirect Genetic Algorithm for Set Covering Problems
Sort
View
WINE
2009
Springer
93views Economy» more  WINE 2009»
14 years 3 months ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...
ICDCS
1999
IEEE
14 years 23 days ago
Incorporating Transaction Semantics to Reduce Reprocessing Overhead in Replicated Mobile Data Applications
Update anywhere-anytime-anyway transactional replication has unstable behavior as the workload scales up. To reduce this problem, a two-tier replication algorithm is proposed in [...
Peng Liu, Paul Ammann, Sushil Jajodia
DAM
2007
91views more  DAM 2007»
13 years 8 months ago
Integer linear programming approaches for non-unique probe selection
In addition to their prevalent use for analyzing gene expression, DNA microarrays are an efficient tool for biological, medical, and industrial applications because of their abil...
Gunnar W. Klau, Sven Rahmann, Alexander Schliep, M...
CANDC
2006
ACM
13 years 8 months ago
Dealing with repetitions in sequencing by hybridization
DNA sequencing by hybridization (SBH) induces errors in the biochemical experiment. Some of them are random and disappear when the experiment is repeated. Others are systematic, i...
Jacek Blazewicz, Fred Glover, Marta Kasprzak, Wojc...
GIS
2011
ACM
12 years 12 months ago
Embedding rivers in triangulated irregular networks with linear programming
Data conflation is a major issue in GIS: different geospatial data sets covering overlapping regions, possibly obtained from different sources and using different acquisition ...
Marc J. van Kreveld, Rodrigo I. Silveira