Sciweavers

2693 search results - page 98 / 539
» On Computing Complex Navigation Functions
Sort
View
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 10 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
STOC
2005
ACM
142views Algorithms» more  STOC 2005»
14 years 10 months ago
Market equilibrium via the excess demand function
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
Bruno Codenotti, Benton McCune, Kasturi R. Varadar...
GCC
2003
Springer
14 years 3 months ago
Coarse-Grained Distributed Parallel Programming Interface for Grid Computing
Abstract. In this paper, a practical coarse-grained distributed parallel programming interface for grid computing (PI4GC) is introduced. des a group of generic and abstract functio...
Yongwei Wu, Qing Wang, Guangwen Yang, Weimin Zheng
JCB
2008
96views more  JCB 2008»
13 years 10 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
DC
2007
13 years 10 months ago
On private computation in incomplete networks
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
Amos Beimel