Sciweavers

16666 search results - page 2805 / 3334
» Descriptive and Computational Complexity
Sort
View
BIBE
2007
IEEE
124views Bioinformatics» more  BIBE 2007»
16 years 1 months ago
Finding Cancer-Related Gene Combinations Using a Molecular Evolutionary Algorithm
—High-throughput data such as microarrays make it possible to investigate the molecular-level mechanism of cancer more efficiently. Computational methods boost the microarray ana...
Chan-Hoon Park, Soo-Jin Kim, Sun Kim, Dong-Yeon Ch...
APPT
2007
Springer
16 years 1 months ago
An Efficient Construction of Node Disjoint Paths in OTIS Networks
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
Weidong Chen, Wenjun Xiao, Behrooz Parhami
CIKM
2007
Springer
16 years 1 months ago
Identifying opinion leaders in the blogosphere
Opinion leaders are those who bring in new information, ideas, and opinions, then disseminate them down to the masses, and thus influence the opinions and decisions of others by a...
Xiaodan Song, Yun Chi, Koji Hino, Belle L. Tseng
COCO
2007
Springer
114views Algorithms» more  COCO 2007»
16 years 1 months ago
Directed Planar Reachability is in Unambiguous Log-Space
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...
COCOA
2007
Springer
16 years 1 months ago
Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp
: We develop a new approach to combinatorial games (e.g., chess, Go, checkers, Chomp, Nim) that unveils connections between such games and nonlinear phenomena commonly seen in natu...
Eric J. Friedman, Adam Scott Landsberg
« Prev « First page 2805 / 3334 Last » Next »