Sciweavers

4767 search results - page 251 / 954
» Structures for Abstract Rewriting
Sort
View
ECAI
2010
Springer
15 years 7 months ago
Computation in Extended Argumentation Frameworks
Extended Argumentation Frameworks (EAFs) are a proposed formalism that develop abstract argumentation frameworks (AFs) by allowing attacks between arguments to be attacked themselv...
Paul E. Dunne, Sanjay Modgil, Trevor J. M. Bench-C...
OL
2008
78views more  OL 2008»
15 years 6 months ago
Slopes of shadow prices and Lagrange multipliers
Abstract Manyeconomicmodels andoptimizationproblems generate(endogenous) shadow prices--alias dual variables or Lagrange multipliers. Frequently the "slopes" of resulting...
Sjur Didrik Flåm, Hubertus Th. Jongen, Olive...
JUCS
2007
99views more  JUCS 2007»
15 years 6 months ago
Metric-Entropy Pairs on Lattices
Abstract: We introduce the notion of ∧- and ∨-pairs of functions on lattices as an abstraction of the notions of metric and its related entropy for probability distributions. T...
Dan A. Simovici
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Untangled Monotonic Chains and Adaptive Range Search
Abstract. We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search perfo...
Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, ...
WABI
2004
Springer
15 years 12 months ago
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns
Abstract. Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set ¡ of elements...
Jens Gramm