Sciweavers

3353 search results - page 166 / 671
» Laver and set theory
Sort
View
SEFM
2007
IEEE
16 years 21 days ago
Automatically Proving Concurrent Programs Correct
of abstract interpretations in formal methods It is always very satisfying to hear about a theory, in the case at hand it is the theory of abstract interpretations, that explains i...
Byron Cook
ADC
2005
Springer
111views Database» more  ADC 2005»
15 years 12 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
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
15 years 12 months ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman
ECAI
2004
Springer
15 years 12 months ago
Soft Constraints with Partially Ordered Preferences
This paper constructs a logic of soft constraints where the set of degrees of preference forms a partially ordered set. When the partially ordered set is a distributive lattice, th...
Nic Wilson
ICFCA
2004
Springer
15 years 11 months ago
Automated Lattice Drawing
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
Ralph Freese