Sciweavers

1884 search results - page 111 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
SECON
2010
IEEE
14 years 9 months ago
Multi-Constrained Anypath Routing in Wireless Mesh Networks
Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In thi...
Xi Fang, Dejun Yang, Pritam Gundecha, Guoliang Xue
CP
2000
Springer
15 years 3 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
SODA
2012
ACM
278views Algorithms» more  SODA 2012»
13 years 2 months ago
Beyond myopic best response (in Cournot competition)
A Nash Equilibrium is a joint strategy profile at which each agent myopically plays a best response to the other agents’ strategies, ignoring the possibility that deviating fro...
Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yish...
GECCO
2009
Springer
125views Optimization» more  GECCO 2009»
15 years 4 months ago
Preserving population diversity for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...
Abel Garcia-Najera
RTAS
1997
IEEE
15 years 4 months ago
OS-Controlled Cache Predictability for Real-Time Systems
3rd IEEE Real-time Technology and Applications Symposium (RTAS), June 1997 in Montreal, Canada Cache-partitioning techniques have been invented to make modern processors with an e...
Jochen Liedtke, Hermann Härtig, Michael Hohmu...