Sciweavers

17288 search results - page 3315 / 3458
» Hybrid Optimizations: Which Optimization Algorithm to Use
Sort
View
ICALP
2010
Springer
15 years 8 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
CSB
2004
IEEE
208views Bioinformatics» more  CSB 2004»
15 years 7 months ago
Pair Stochastic Tree Adjoining Grammars for Aligning and Predicting Pseudoknot RNA Structures
Motivation: Since the whole genome sequences for many species are currently available, computational predictions of RNA secondary structures and computational identifications of t...
Hiroshi Matsui, Kengo Sato, Yasubumi Sakakibara
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
15 years 7 months ago
On the Complexity of Graph Self-assembly in Accretive Systems
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...
FPCA
1995
15 years 7 months ago
Pi-Calculus, Dialogue Games and PCF
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
J. M. E. Hyland, C.-H. Luke Ong
IWCMC
2010
ACM
15 years 6 months ago
Secure wireless communication platform for EV-to-Grid research
"Vehicle to Grid" power or V2G will be a new green energy scheme that allows electricity to flow from Electric Vehicles (EVs) to power lines. The objective of this paper...
Huaqun Guo, Fan Yu, Wai-Choong Wong, Vivy Suhendra...
« Prev « First page 3315 / 3458 Last » Next »