612 search results - page 16 / 123 » Hardness assumptions in the foundations of theoretical compu... |
IJPP
2007
13 years 7 months ago
2007
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
MOBIHOC
2009
ACM
14 years 8 months ago
2009
ACM
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
ITICSE
2006
ACM
14 years 1 months ago
2006
ACM
It is well known that women’s involvement in the field of Computer Science is very low in the USA. This is viewed as a significant problem and has become a great concern to educ...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...