Sciweavers

2214 search results - page 61 / 443
» complexity 2004
Sort
View
ICCS
2004
Springer
14 years 1 months ago
Towards a Generalised Runtime Environment for Parallel Haskells
Abstract. Implementations of parallel dialects (or: coordination languages) on a functional base (or: computation) language always have to extend complex runtime environments by th...
Jost Berthold
ECIS
2000
13 years 9 months ago
Digital Material in a Political Work Context - The Case of Cuparla
Abstract - Understanding the appropriation of CSCW-Tools is key to their successful implementation. This paper explores the social and organizational appropriation of the Cuparla C...
Gerhard Schwabe, Helmut Krcmar
ATAL
2004
Springer
14 years 1 months ago
Diagnosing a Team of Agents: Scaling-Up
Abstract. Agents in a team must be in agreement. Once a disagreement occurs we should detect the disagreement and diagnose it. Unfortunately, current diagnosis techniques do not sc...
Meir Kalech, Gal A. Kaminka
ISSAC
2011
Springer
243views Mathematics» more  ISSAC 2011»
12 years 10 months ago
Practical polynomial factoring in polynomial time
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
William Hart, Mark van Hoeij, Andrew Novocin
ICSR
2004
Springer
14 years 1 months ago
Variability and Component Composition
In component-based product populations, variability has to be described at the component level to be able to benefit from a product family approach. As a consequence, composition ...
Tijs van der Storm