Sciweavers

699 search results - page 90 / 140
» The method of combinatorial telescoping
Sort
View
94
Voted
INFORMATICALT
2010
101views more  INFORMATICALT 2010»
14 years 11 months ago
An Improved Differential Evolution Scheme for the Solution of Large-Scale Unit Commitment Problems
This paper presents an improved differential evolution (IDE) method for the solution of large-scale unit commitment (UC) problems. The objective of the proposed scheme is to determ...
Chen-Sung Chang
ICTAI
2010
IEEE
14 years 10 months ago
Combining Mixed Integer Programming and Supervised Learning for Fast Re-planning
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
Emmanuel Rachelson, Ala Ben Abbes, Sebastien Dieme...
105
Voted
LCN
2005
IEEE
15 years 6 months ago
Simulated Annealing based Localization in Wireless Sensor Network
— In this paper, we describe a novel localization method for ad hoc wireless sensor networks. Accurate selforganization and localization is an essential characteristic of high pe...
Anushiya A. Kannan, Guoqiang Mao, Branka Vucetic
112
Voted
WWW
2009
ACM
16 years 1 months ago
Quicklink selection for navigational query results
Quicklinks for a website are navigational shortcuts displayed below the website homepage on a search results page, and that let the users directly jump to selected points inside t...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
173
Voted
RECOMB
2001
Springer
16 years 26 days ago
Finding motifs using random projections
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
Jeremy Buhler, Martin Tompa