Sciweavers

26354 search results - page 178 / 5271
» How we refactor, and how we know it
Sort
View
FPCA
1995
14 years 2 months ago
How Much Non-Strictness do Lenient Programs Require?
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
Klaus E. Schauser, Seth Copen Goldstein
AAAI
2008
14 years 1 months ago
How Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Malte Helmert, Gabriele Röger
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 11 months ago
How to meet asynchronously (almost) everywhere
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 10 months ago
How Do Emerging Technologies Conquer the World? An Exploration of Patterns of Diffusion and Network Formation
Grasping the fruits of "emerging technologies" is an objective of many government priority programs in a knowledge-based and globalizing economy. We use the publication ...
Loet Leydesdorff, Ismael Rafols
IJNM
2008
112views more  IJNM 2008»
13 years 10 months ago
How to avoid packet droppers with proactive routing protocols for ad hoc networks
Routing protocols for mobile ad hoc networks (MANETs) have been an active area of research for the last decade, with many very interesting potential as well as actual applications...
Ignacy Gawedzki, Khaldoun Al Agha