Sciweavers

330 search results - page 12 / 66
» Open Problems in Logic and Games
Sort
View
ICALP
2010
Springer
14 years 23 days ago
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
Nikhil Bansal, Subhash Khot
DM
2008
82views more  DM 2008»
13 years 8 months ago
Problems and results in extremal combinatorics - II
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
Noga Alon
AAMAS
2002
Springer
13 years 7 months ago
Multiagent Learning for Open Systems: A Study in Opponent Classification
Abstract. Open systems are becoming increasingly important in a variety of distributed, networked computer applications. Their characteristics, such as agent diversity, heterogenei...
Michael Rovatsos, Gerhard Weiß, Marco Wolf
OORASE
1999
Springer
14 years 6 days ago
OpenJava: A Class-Based Macro System for Java
This paper presents OpenJava, which is a macro system that we have developed for Java. With traditional macro systems designed for non object-oriented languages, it is difficult to...
Michiaki Tatsubori, Shigeru Chiba, Kozo Itano, Mar...
AI
2007
Springer
13 years 8 months ago
Subjective logic and arguing with evidence
This paper introduces a Subjective Logic based argumentation framework primarily targeted at evidential reasoning. The framework explicitly caters for argument schemes, accrual of...
Nir Oren, Timothy J. Norman, Alun D. Preece