Sciweavers

798 search results - page 129 / 160
» Using Genetic Algorithms for Solving Hard Problems in GIS
Sort
View
CPM
1998
Springer
115views Combinatorics» more  CPM 1998»
14 years 23 days ago
Aligning Alignments
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Weiqing Zhang
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...
FOCS
2008
IEEE
13 years 8 months ago
Market Equilibria in Polynomial Time for Fixed Number of Goods or Agents
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
Nikhil R. Devanur, Ravi Kannan
KDD
2006
ACM
191views Data Mining» more  KDD 2006»
14 years 9 months ago
Beyond classification and ranking: constrained optimization of the ROI
Classification has been commonly used in many data mining projects in the financial service industry. For instance, to predict collectability of accounts receivable, a binary clas...
Lian Yan, Patrick Baldasare
PODC
2005
ACM
14 years 2 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer