Sciweavers

920 search results - page 12 / 184
» Computing the Frequency of Partial Orders
Sort
View
HEURISTICS
2006
102views more  HEURISTICS 2006»
13 years 7 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson
ATAL
2006
Springer
13 years 11 months ago
Strategic voting when aggregating partially ordered preferences
Preferences of a single agent are often partially ordered. For example, it may be hard to compare a novel with a biography. In such a situation, the agent may want the novel and t...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
SOFSEM
2009
Springer
14 years 5 days ago
Partial Order Semantics of Types of Nets
In this paper we define partial order semantics of types of nets. Types of nets are a parametric definition of Petri nets originally developed for a general presentation of the s...
Robert Lorenz, Gabriel Juhás, Sebastian Mau...
STTT
2010
97views more  STTT 2010»
13 years 6 months ago
Distributed dynamic partial order reduction
Abstract. Runtime (dynamic) model checking is a promising verification methodology for real-world threaded software because of its many features, the prominent ones being: (i) it ...
Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Rob...
NAA
2000
Springer
97views Mathematics» more  NAA 2000»
13 years 11 months ago
Nested-Dissection Orderings for Sparse LU with Partial Pivoting
We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilb...
Igor Brainman, Sivan Toledo