Sciweavers

837 search results - page 80 / 168
» Hard combinators
Sort
View
SFP
2003
15 years 1 months ago
Testing reactive systems with GAST
G∀ST is a fully automatic test system. Given a logical property, stated as a function, it is able to generate appropriate test values, to execute tests with these values, and to ...
Pieter W. M. Koopman, Rinus Plasmeijer
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
15 years 1 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller
DEXAW
2010
IEEE
181views Database» more  DEXAW 2010»
15 years 1 months ago
Bridging the Gap between Heterogeneous and Semantically Diverse Content of Different Disciplines
The Web has been flooded with highly heterogeneous data sources that freely offer their data to the public. Careful design and compliance to standards is a way to cope with the he...
Siarhei Bykau, Nadzeya Kiyavitskaya, Chrisa Tsinar...
81
Voted
MM
2010
ACM
174views Multimedia» more  MM 2010»
15 years 2 days ago
Image classification using the web graph
Image classification is a well-studied and hard problem in computer vision. We extend a proven solution for classifying web spam to handle images. We exploit the link structure of...
Dhruv Kumar Mahajan, Malcolm Slaney
AAMAS
2007
Springer
15 years 19 hour ago
A formal framework for connective stability of highly decentralized cooperative negotiations
Abstract. Multiagent cooperative negotiation is a promising technique for modeling and controlling complex systems. Effective and flexible cooperative negotiations are especially...
Francesco Amigoni, Nicola Gatti