Sciweavers

3307 search results - page 481 / 662
» The meaning of concurrent programs
Sort
View
ICGA
2007
157views Optimization» more  ICGA 2007»
15 years 7 months ago
Computing "Elo Ratings" of Move Patterns in the Game of Go
Abstract. Move patterns are an essential method to incorporate domain knowledge into Go-playing programs. This paper presents a new Bayesian technique for supervised learning of su...
Rémi Coulom
SAC
2008
ACM
15 years 6 months ago
Flexible pointer analysis using assign-fetch graphs
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
Marcio Buss, Daniel Brand, Vugranam C. Sreedhar, S...
HEURISTICS
2008
136views more  HEURISTICS 2008»
15 years 5 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
4OR
2010
148views more  4OR 2010»
15 years 5 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
240
Voted
DASIP
2010
15 years 2 months ago
High level design space exploration of RVC codec specifications for multi-core heterogeneous platforms
Nowadays, the design flow of complex signal processing embedded systems starts with a specification of the application by means of a large and sequential program (usually in C/C++...
Christophe Lucarz, Ghislain Roquier, Marco Mattave...