Sciweavers

2386 search results - page 222 / 478
» Representing and Reasoning with Preferences
Sort
View
ICGI
2004
Springer
15 years 12 months ago
Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA
State Merging algorithms, such as Rodney Price’s EDSM (Evidence-Driven State Merging) algorithm, have been reasonably successful at solving DFA-learning problems. EDSM, however, ...
John Abela, François Coste, Sandro Spina
SGAI
2004
Springer
15 years 12 months ago
Implementing Policy Management through BDI
The requirement for Grid middleware to be largely transparent to individual users and at the same time act in accordance with their personal needs is a difficult challenge. In e-...
Simon Miles, Juri Papay, Michael Luck, Luc Moreau
ECBS
2010
IEEE
147views Hardware» more  ECBS 2010»
15 years 12 months ago
Supporting Customizable Architectural Design Decision Management
—When engineering complex software systems, the key Architectural Design Decisions (ADD) and the reasoning underlying those decisions need to be fully understood by all stakehold...
Lianping Chen, Muhammad Ali Babar
FOCS
2003
IEEE
15 years 12 months ago
Towards a Characterization of Truthful Combinatorial Auctions
This paper analyzes implementable social choice functions (in dominant strategies) over restricted domains of preferences, the leading example being combinatorial auctions. Our wo...
Ron Lavi, Ahuva Mu'alem, Noam Nisan
INFOCOM
2003
IEEE
15 years 12 months ago
On-line Tuning of Prices for Network Services
— Recent investigations into the pricing of multiclass loss networks have shown that static prices are optimal in the asymptotic regime of many small sources. These results sugge...
Enrique Campos-Náñez, Stephen D. Pat...