Sciweavers

3946 search results - page 155 / 790
» The computational complexity of choice sets
Sort
View
APLAS
2004
ACM
15 years 12 months ago
A Functional Language for Logarithmic Space
Abstract. More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas efficiently. The design choices however eï...
Peter Møller Neergaard
UML
2001
Springer
15 years 11 months ago
UML Modelling and Performance Analysis of Mobile Software Architectures
Modern distributed software applications generally operate in complex and heterogeneous computing environments (like the World Wide Web). Different paradigms (client-server, mobili...
Vincenzo Grassi, Raffaela Mirandola
SBBD
2004
119views Database» more  SBBD 2004»
15 years 8 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
ATAL
2006
Springer
15 years 10 months ago
The communication complexity of coalition formation among autonomous agents
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
Ariel D. Procaccia, Jeffrey S. Rosenschein
RECOMB
2008
Springer
16 years 6 months ago
Bootstrapping the Interactome: Unsupervised Identification of Protein Complexes in Yeast
Protein interactions and complexes are major components of biological systems. Recent genome-wide applications of tandem affinity purification (TAP) in yeast have increased signifi...
Caroline C. Friedel, Jan Krumsiek, Ralf Zimmer