Sciweavers

1941 search results - page 116 / 389
» On the Hardness of Approximate Reasoning
Sort
View
CLEIEJ
2010
15 years 3 months ago
Teaching Programming Principles through a Game Engine
Teaching fundamental programming to freshmen is a hard task to be performed, given the high level action and logical reasoning that are required for these students to develop in a...
Cristiane Camilo Hernandez, Luciano Silva, Rafael ...
CORR
2002
Springer
125views Education» more  CORR 2002»
15 years 6 months ago
Complexity of Manipulating Elections with Few Candidates
In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal r...
Vincent Conitzer, Tuomas Sandholm
IPPS
2009
IEEE
16 years 1 months ago
Combining multiple heuristics on discrete resources
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
Marin Bougeret, Pierre-François Dutot, Alfr...
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
15 years 7 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
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
15 years 7 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...