Sciweavers

1350 search results - page 7 / 270
» Generalized Committed Choice
Sort
View
SIGECOM
2010
ACM
165views ECommerce» more  SIGECOM 2010»
15 years 7 months ago
Computing optimal strategies to commit to in extensive-form games
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
Joshua Letchford, Vincent Conitzer
102
Voted
VLDB
2001
ACM
93views Database» more  VLDB 2001»
15 years 7 months ago
Transaction Timestamping in (Temporal) Databases
Many database applications need accountability and trace-ability that necessitate retaining previous database states. For a transaction-time database supporting this, the choice o...
Christian S. Jensen, David B. Lomet
97
Voted
SWAT
2004
Springer
156views Algorithms» more  SWAT 2004»
15 years 8 months ago
The Bottleneck Problem with Minimum Quantity Commitments
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
Andrew Lim, Zhou Xu
105
Voted
AO
2008
81views more  AO 2008»
15 years 2 months ago
Institutionalising ontology-based semantic integration
Abstract. We address what is still a scarcity of general mathematical foundations for ontology-based semantic integration underlying current knowledge engineering methodologies in ...
W. Marco Schorlemmer, Yannis Kalfoglou
SLE
2009
Springer
15 years 9 months ago
Ontological Metamodeling with Explicit Instantiation
Model Driven Engineering (MDE) is a promising paradigm for development. It raises the level of abstraction in software development by treating models as primary artifacts. The prac...
Alfons Laarman, Ivan Kurtev