Sciweavers

1559 search results - page 172 / 312
» Fundamentals of Generic Programming
Sort
View
SIAMJO
2010
87views more  SIAMJO 2010»
14 years 4 months ago
Universal Rigidity and Edge Sparsification for Sensor Network Localization
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
Zhisu Zhu, Anthony Man-Cho So, Yinyu Ye
ICFP
2012
ACM
13 years 10 days ago
Transporting functions across ornaments
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
Pierre-Évariste Dagand, Conor McBride
SIGMOD
2008
ACM
182views Database» more  SIGMOD 2008»
15 years 10 months ago
Multi-tenant databases for software as a service: schema-mapping techniques
In the implementation of hosted business services, multiple tenants are often consolidated into the same database to reduce total cost of ownership. Common practice is to map mult...
Stefan Aulbach, Torsten Grust, Dean Jacobs, Alfons...
DAWAK
2001
Springer
15 years 2 months ago
Matchmaking for Structured Objects
A fundamental task in multi-agent systems is matchmaking, which is to retrieve and classify service descriptions of agents that (best) match a given service request. Several approa...
Thomas Eiter, Daniel Veit, Jörg P. Mülle...
ESOP
2009
Springer
15 years 4 months ago
Conversation Types
We present a type theory for analyzing concurrent multiparty interactions as found in service-oriented computing. Our theory introduces a novel and flexible type structure, able t...
Luís Caires, Hugo Torres Vieira