Sciweavers

3897 search results - page 307 / 780
» complexity 2010
Sort
View
JAIR
2010
145views more  JAIR 2010»
15 years 5 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint
JCSS
2010
112views more  JCSS 2010»
15 years 5 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn
JELIA
2010
Springer
15 years 5 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
JPDC
2010
117views more  JPDC 2010»
15 years 5 months ago
Extensible transactional memory testbed
Transactional Memory (TM) is a promising abstraction as it hides all synchronization complexities from the programmers of concurrent applications. More particularly the TM paradig...
Derin Harmanci, Vincent Gramoli, Pascal Felber, Ch...
JSS
2010
138views more  JSS 2010»
15 years 5 months ago
The Linux kernel as a case study in software evolution
We use 810 versions of the Linux kernel, released over a period of 14 years, to characterize the system’s evolution, using Lehman’s laws of software evolution as a basis. We i...
Ayelet Israeli, Dror G. Feitelson