Sciweavers

12825 search results - page 1986 / 2565
» Improved PLSOM algorithm
Sort
View
BIBM
2010
IEEE
157views Bioinformatics» more  BIBM 2010»
15 years 5 months ago
Decomposing PPI networks for complex discovery
Abstract--Protein complexes are important for understanding principles of cellular organization and functions. With the availability of large amounts of high-throughput proteinprot...
Guimei Liu, Chern Han Yong, Limsoon Wong, Hon Nian...
213
Voted
CG
2004
Springer
15 years 10 months ago
Locally Informed Global Search for Sums of Combinatorial Games
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
Martin Müller 0003, Zhichao Li
CP
2006
Springer
15 years 10 months ago
Adaptive Clause Weight Redistribution
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
Abdelraouf Ishtaiwi, John Thornton, Anbulagan, Abd...
WICON
2008
15 years 8 months ago
Channel assignment with partially overlapping channels in wireless mesh networks
Many efforts have been devoted to maximizing the network throughput with limited channel resources in multi-radio multi-channel wireless mesh networks. It has been believed that t...
Yong Ding, Yi Huang, Guo-Kai Zeng, Li Xiao
IOPADS
1996
87views more  IOPADS 1996»
15 years 8 months ago
Structured Permuting in Place on Parallel Disk Systems
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
Leonard F. Wisniewski
« Prev « First page 1986 / 2565 Last » Next »