Sciweavers

900 search results - page 141 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
ICSM
2007
IEEE
14 years 3 months ago
On the prediction of the evolution of libre software projects
Libre (free / open source) software development is a complex phenomenon. Many actors (core developers, casual contributors, bug reporters, patch submitters, users, etc.), in many ...
Israel Herraiz, Jesús M. González-Ba...
JAIR
2010
139views more  JAIR 2010»
13 years 7 months ago
Multiattribute Auctions Based on Generalized Additive Independence
We develop multiattribute auctions that accommodate generalized additive independent (GAI) preferences. We propose an iterative auction mechanism that maintains prices on potentia...
Yagil Engel, Michael P. Wellman
PERCOM
2003
ACM
14 years 1 months ago
Object Labelling from Human Action Recognition
This paper presents a method for finding and classifying objects within real-world scenes by using the activity of humans interacting with these objects to infer the object’s i...
Patrick Peursum, Svetha Venkatesh, Geoff A. W. Wes...
FASE
2010
Springer
13 years 12 months ago
Efficient Runtime Assertion Checking of Assignable Clauses with Datagroups
Runtime assertion checking is useful for debugging programs and specifications. Existing tools check invariants as well as method preand postconditions, but mostly ignore assignabl...
Hermann Lehner, Peter Müller
SSDBM
2011
IEEE
239views Database» more  SSDBM 2011»
13 years 10 days ago
Recipes for Baking Black Forest Databases - Building and Querying Black Hole Merger Trees from Cosmological Simulations
Large-scale N-body simulations play an important role in advancing our understanding of the formation and evolution of large structures in the universe. These computations require ...
Julio López, Colin Degraf, Tiziana DiMatteo...