Sciweavers

1071 search results - page 90 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
CDES
2006
99views Hardware» more  CDES 2006»
13 years 9 months ago
Teraflop Computing for Nanoscience
: Over the last three decades there has been significant progress in the first principles methods for calculating the properties of materials at the quantum level. They have largel...
Yang Wang 0008, G. M. Stocks, Aurelian Rusanu, D. ...
DEBU
2008
187views more  DEBU 2008»
13 years 8 months ago
Social SQL: Tools for Exploring Social Databases
Social media are constructed from the collective contributions of potentially millions of individuals and present an increasingly common and large scale form of database. As these...
Marc A. Smith, Vladimir Barash
ALDT
2009
Springer
162views Algorithms» more  ALDT 2009»
14 years 2 months ago
Compact Preference Representation in Stable Marriage Problems
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...
Enrico Pilotto, Francesca Rossi, Kristen Brent Ven...
COMPGEOM
2011
ACM
12 years 11 months ago
Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains
Several recent works considered cooperative cleaning in static and dynamic environments, which incorporates a swarm of simple robots cleaning an expanding region of contaminated c...
Thilo Beckmann, Rolf Klein, David Kriesel, Elmar L...
FM
2006
Springer
161views Formal Methods» more  FM 2006»
13 years 12 months ago
Changing Programs Correctly: Refactoring with Specifications
Refactorings change the internal structure of code without changing its external behavior. For non-trivial refactorings, the preservation of external behavior depends on semantic p...
Fabian Bannwart, Peter Müller