Sciweavers

603 search results - page 48 / 121
» DFS-Tree Based Heuristic Search
Sort
View
CPAIOR
2008
Springer
13 years 9 months ago
Counting Solutions of Knapsack Constraints
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
Gilles Pesant, Claude-Guy Quimper
WASA
2009
Springer
126views Algorithms» more  WASA 2009»
14 years 2 months ago
Data Collection with Multiple Sinks in Wireless Sensor Networks
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multip...
Sixia Chen, Matthew Coolbeth, Hieu Dinh, Yoo-Ah Ki...
EUROMICRO
2000
IEEE
14 years 11 days ago
Task Assignment and Scheduling under Memory Constraints
Many DSP and image processing embedded systems have hard memory constraints which makes it difficult to find a good task assignment and scheduling which fulfill these constrain...
Radoslaw Szymanek, Krzysztof Kuchcinski
ERCIMDL
2010
Springer
180views Education» more  ERCIMDL 2010»
13 years 5 months ago
SciPlore Xtract: Extracting Titles from Scientific PDF Documents by Analyzing Style Information (Font Size)
Extracting titles from a PDFs full text is an important task in information retrieval to identify PDFs. Existing approaches apply complicated and expensive (in terms of calculating...
Jöran Beel, Bela Gipp, Ammar Shaker, Nick Fri...
SCFBM
2008
131views more  SCFBM 2008»
13 years 7 months ago
FASH: A web application for nucleotides sequence search
: FASH (Fourier Alignment Sequence Heuristics) is a web application, based on the Fast Fourier Transform, for finding remote homologs within a long nucleic acid sequence. Given a ...
Isana Veksler-Lublinsky, Danny Barash, Chai Avisar...