1382 search results - page 192 / 277 » Formal Analysis of Online Algorithms |
167
click to vote
EVOW
2007
Springer
16 years 16 days ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
170
click to vote
GECCO
2007
Springer
16 years 16 days ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
179
click to vote
ICDCSW
2006
IEEE
16 years 13 days ago
2006
IEEE
Channel allocation has been extensively studied in the framework of cellular networks, but the emergence of new system concepts, such as cognitive radio systems, bring this topic ...
183
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
Although sorts and unary predicates are semantically identical in order-sorted logic, they are classified as different kinds of properties in formal ontology (e.g. sortal and non...
193
click to vote
MDM
2004
Springer
15 years 11 months ago
2004
Springer
The decoupling of producers and consumers in time and space in the publish/subscribe paradigm lends itself well to the support of mobile users who roam about the environment and h...