4526 search results - page 606 / 906 » Algorithmic problems related to the Internet |
186
click to vote
CP
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
174
click to vote
ECCC
2006
15 years 6 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
246
click to vote
LANOMS
2007
IEEE
16 years 1 months ago
2007
IEEE
—Recently there is a growing interest in accessing network measurement and status data across multiple domains, in order to detect eventual network problems which can hinder the ...
167
Voted
SEMWEB
2007
Springer
16 years 25 days ago
2007
Springer
Our research explores the possibilities for factoring culture into user models, working towards cultural adaptivity in the semantic web. The aim is to represent the user’s positi...
198
click to vote
MIR
2005
ACM
16 years 8 days ago
2005
ACM
It is estimated that less than ten percent of the world’s species have been discovered and described. The main reason for the slow pace of new species description is that the sc...