Sciweavers

10585 search results - page 2116 / 2117
» The Orc Programming Language
Sort
View
LOGCOM
2010
152views more  LOGCOM 2010»
13 years 2 months ago
Constructive Logic with Strong Negation as a Substructural Logic
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
Manuela Busaniche, Roberto Cignoli
LR
2011
156views more  LR 2011»
13 years 1 months ago
The assessment of competitive intensity in logistics markets
Scopus is the world’s largest abstract and citation database of peer-reviewed literature and quality web sources (-> http://www.info.sciverse.com/scopus). ontains 41 million r...
Peter Klaus
HICSS
2011
IEEE
157views Biometrics» more  HICSS 2011»
12 years 11 months ago
Reusing Relational Queries for Intuitive Decision Optimization
— Decision optimization is used in many applications such as those for finding the best course of action in emergencies. However, optimization solutions require considerable mat...
Alexander Brodsky, Nathan E. Egge, Xiaoyang Sean W...
HPCA
2011
IEEE
12 years 11 months ago
Dynamic parallelization of JavaScript applications using an ultra-lightweight speculation mechanism
As the web becomes the platform of choice for execution of more complex applications, a growing portion of computation is handed off by developers to the client side to reduce net...
Mojtaba Mehrara, Po-Chun Hsu, Mehrzad Samadi, Scot...
ICALP
2009
Springer
14 years 7 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
« Prev « First page 2116 / 2117 Last » Next »