Sciweavers

4679 search results - page 749 / 936
» Modeling When Connections Are the Problem
Sort
View
APPROX
2005
Springer
122views Algorithms» more  APPROX 2005»
15 years 12 months ago
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Uriel Feige, Eran Ofek
FC
2005
Springer
120views Cryptology» more  FC 2005»
15 years 12 months ago
Achieving Fairness in Private Contract Negotiation
Abstract. Suppose Alice and Bob are two entities (e.g. agents, organizations, etc.) that wish to negotiate a contract. A contract consists of several clauses, and each party has ce...
Keith B. Frikken, Mikhail J. Atallah
ICMI
2005
Springer
120views Biometrics» more  ICMI 2005»
15 years 12 months ago
Perceiving ordinal data haptically under workload
Visual information overload is a threat to the interpretation of displays presenting large data sets or complex application environments. To combat this problem, researchers have ...
Anthony Tang, Peter McLachlan, Karen Lowe, Chalapa...
PKDD
2005
Springer
164views Data Mining» more  PKDD 2005»
15 years 12 months ago
Clustering and Prediction of Mobile User Routes from Cellular Data
Location-awareness and prediction of future locations is an important problem in pervasive and mobile computing. In cellular systems (e.g., GSM) the serving cell is easily availabl...
Kari Laasonen
ACMICEC
2004
ACM
107views ECommerce» more  ACMICEC 2004»
15 years 11 months ago
Reasoning about commitments in multiple concurrent negotiations
Automated negotiation by software agents is a key enabling technology for agent mediated e-commerce. To this end, this paper considers an important class of such negotiations — ...
Thuc Duong Nguyen, Nicholas R. Jennings