Sciweavers

1277 search results - page 160 / 256
» Terminating Decision Algorithms Optimally
Sort
View
138
Voted
IPL
2002
118views more  IPL 2002»
15 years 3 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
140
Voted
OOPSLA
2009
Springer
15 years 10 months ago
Towards automation of iteration planning
Iterations are time-boxed periods with an intended outcome that is often a set of implemented requirements. Iterations are part of most common software development lifecycle model...
Jonas Helming, Maximilian Koegel, Zardosht Hodaie
128
Voted
MOBICOM
2006
ACM
15 years 9 months ago
Robust rate adaptation for 802.11 wireless networks
Rate adaptation is a mechanism unspecified by the 802.11 standards, yet critical to the system performance by exploiting the multi-rate capability at the physical layer. In this ...
Starsky H. Y. Wong, Songwu Lu, Hao Yang, Vaduvur B...
137
Voted
ACMICEC
2007
ACM
154views ECommerce» more  ACMICEC 2007»
15 years 7 months ago
Learning and adaptivity in interactive recommender systems
Recommender systems are intelligent E-commerce applications that assist users in a decision-making process by offering personalized product recommendations during an interaction s...
Tariq Mahmood, Francesco Ricci
113
Voted
GECCO
2004
Springer
15 years 9 months ago
Multi-agent Cooperation Using Genetic Network Programming with Automatically Defined Groups
In this paper, we propose a genetic network programming (GNP) architecture using a coevolution model called automatically defined groups (ADG). The GNP evolves networks for describ...
Tadahiko Murata, Takashi Nakamura