409 search results - page 41 / 82 » Polynomial Time Approximation Schemes and Parameterized Comp... |
108
Voted
AAAI
2007
14 years 12 months ago
2007
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
DIALM
2003
ACM
15 years 2 months ago
2003
ACM
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
JUCS
2010
14 years 8 months ago
2010
: Mobile agent technology advocates the mobility of code rather than the transfer of data. As data is found in several sites, a mobile agent has to plan an itinerary to visit sever...
100
click to vote
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—Most research on differential MIMO is based on spacetime block codes, aiming to achieve maximum transmit diversity and thus make the transmission more robust by the aid ...
COMPGEOM
1993
ACM
15 years 1 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...