I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Testing Preferential Domains Using Sampling:
, In:
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems
,
Dey, Palash
;
Nath, Swaprava
;
Shakya, Garima
- p. 855-863 , 2019
Link:
https://dl.acm.org/doi/10.5555/3306127.3331777
RT T1
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems
: T1
Testing Preferential Domains Using Sampling
UL https://suche.suub.uni-bremen.de/peid=acm-3331777&Exemplar=1&LAN=DE A1 Dey, Palash A1 Nath, Swaprava A1 Shakya, Garima PB International Foundation for Autonomous Agents and Multiagent Systems YR 2019 K1 algorithms K1 almost single crossing K1 almost single peak K1 computational social choice K1 preferential domain K1 sampling K1 testing K1 Theory of computation K1 Theory and algorithms for application domains K1 Algorithmic game theory and mechanism design K1 Algorithmic game theory K1 Design and analysis of algorithms K1 Streaming, sublinear and near linear time algorithms SP 855 OP 863 LK http://dx.doi.org/https://dl.acm.org/doi/10.5555/3306127.3331777 DO https://dl.acm.org/doi/10.5555/3306127.3331777 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)