6455 search results - page 273 / 1291 » Research problems |
143
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
162
click to vote
INFOCOM
2007
IEEE
16 years 27 days ago
2007
IEEE
— Significant research has been dedicated to methods that estimate the available bandwidth in a network from traffic measurements. While estimation methods abound, less progres...
177
click to vote
GCC
2007
Springer
16 years 23 days ago
2007
Springer
On building a service-oriented architecture for Grid systems, more and more researches have been focused on service composition. Services, however, are not always exactly compatib...
156
click to vote
PKDD
2007
Springer
16 years 21 days ago
2007
Springer
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
198
click to vote
IPPS
2005
IEEE
16 years 6 days ago
2005
IEEE
— Program code size is a critical factor in determining the manufacturing cost of many embedded systems, particularly those aimed at the extremely costconscious consumer market. ...