Sciweavers

2410 search results - page 34 / 482
» Multiset Ordering Constraints
Sort
View
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
15 years 11 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur
SYNASC
2005
IEEE
84views Algorithms» more  SYNASC 2005»
15 years 10 months ago
Membrane Computing as a Framework for Modeling Economic Processes
Abstract. This paper is a first step towards a systematic evaluation of the possibilities to use membrane computing as a modeling framework for economics. Membrane computing is a ...
Gheorghe Paun, Radu A. Paun
ADC
2005
Springer
111views Database» more  ADC 2005»
15 years 10 months ago
Redundancy, Dependencies and Normal Forms for XML Databases
With the advent of XML and its use as a database language, dependency and normal form theory has attracted novel research interest. Several approaches to build up a dependency and...
Klaus-Dieter Schewe
DAGSTUHL
2007
15 years 5 months ago
Anonymity-Proof Voting Rules
A (randomized, anonymous) voting rule maps any multiset of total orders (aka. votes) over a fixed set of alternatives to a probability distribution over these alternatives. A voti...
Vincent Conitzer
COLING
1992
15 years 5 months ago
The Proper Treatment Of Word Order In HPSG
: This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewin...
Karel Oliva