85 search results - page 4 / 17 » Inconsistent heuristics in theory and practice |
CSC
2008
14 years 11 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
REFSQ
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Requirements engineering is still an area of software engineering in which theory and practice greatly differ. This work presents the results of an empirical study of ar...
HICSS
2009
IEEE
15 years 4 months ago
2009
IEEE
Information systems (IS) researchers have made considerable progress on defining and formalizing structured methods to support collaborative development of information systems. Co...
107
click to vote
CDC
2008
IEEE
14 years 9 months ago
2008
IEEE
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
SOFSEM
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Computational mechanism design (CMD) seeks to understand how to design game forms that induce desirable outcomes in multiagent systems despite private information, self-i...