Sciweavers

14774 search results - page 270 / 2955
» Computational complexity and evolutionary computation
Sort
View
CSREASAM
2003
15 years 8 months ago
Developing Secure Web Services for Computational Portals
Computational web portals provide uniform access to remote computational resources--hardware, software, and data--by hiding the complexity of the heterogeneous, distributed, high ...
Choon-Han Youn, Marlon E. Pierce, Geoffrey Fox
JCB
2008
96views more  JCB 2008»
15 years 6 months ago
Computing Knock-Out Strategies in Metabolic Networks
Given a metabolic network in terms of its metabolites and reactions, our goal is to efficiently compute the minimal knock out sets of reactions required to block a given behaviour....
Utz-Uwe Haus, Steffen Klamt, Tamon Stephen
JSC
2006
64views more  JSC 2006»
15 years 6 months ago
Computing the support of local cohomology modules
For a polynomial ring R = k[x1, ..., xn], we present a method to compute the characteristic cycle of the localization Rf for any nonzero polynomial f R that avoids a direct comput...
Josep Àlvarez Montaner, Anton Leykin
SIGCSE
2002
ACM
88views Education» more  SIGCSE 2002»
15 years 6 months ago
Teaching computer organization/architecture with limited resources using simulators
As the complexity and variety of computer system hardware increases, its suitability as a pedagogical tool in computer organization/architecture courses diminishes. As a consequen...
Gregory S. Wolffe, William Yurcik, Hugh Osborne, M...
WG
2010
Springer
15 years 4 months ago
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov...