Sciweavers

341 search results - page 67 / 69
» Redundancy elimination revisited
Sort
View
AAAI
1996
13 years 9 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
BMCBI
2007
112views more  BMCBI 2007»
13 years 7 months ago
Selecting dissimilar genes for multi-class classification, an application in cancer subtyping
Background: Gene expression microarray is a powerful technology for genetic profiling diseases and their associated treatments. Such a process involves a key step of biomarker ide...
Zhipeng Cai, Randy Goebel, Mohammad R. Salavatipou...
JCIT
2008
138views more  JCIT 2008»
13 years 7 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan
JSA
2008
91views more  JSA 2008»
13 years 7 months ago
Using supplier locality in power-aware interconnects and caches in chip multiprocessors
Conventional snoopy-based chip multiprocessors take an aggressive approach broadcasting snoop requests to all nodes. In addition each node checks all received requests. This appro...
Ehsan Atoofian, Amirali Baniasadi
IIE
2007
120views more  IIE 2007»
13 years 7 months ago
Words are Silver, Mouse-Clicks are Gold? (or how to optimize the level of language formalization of young students in a Logo-bas
How do we teach children to express and communicate ideas in a formal and informal mode? What type of language do they need in a concrete context? How should they determine a prope...
Evgenia Sendova, Toni Chehlarova, Pavel Boytchev