Sciweavers

2621 search results - page 190 / 525
» Near orders and codes
Sort
View
COR
2010
129views more  COR 2010»
15 years 4 months ago
Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case
We consider the context of decision support for schedule modification after the computation off-line of a predictive optimal (or near optimal) schedule. The purpose of this work i...
Mohamed Ali Aloulou, Christian Artigues
COMBINATORICA
2010
15 years 4 months ago
A randomized embedding algorithm for trees
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
Benny Sudakov, Jan Vondrák
CSEE
2011
Springer
14 years 10 months ago
Pex4Fun: Teaching and learning computer science via social gaming
Pex4Fun (http://www.pexforfun.com/)from Microsoft Research is a web-based serious gaming environment for teaching computer science. Pex4Fun can be used to teach and learn computer...
Nikolai Tillmann, Jonathan de Halleux, Tao Xie
ICIP
2006
IEEE
16 years 8 months ago
A Multi-View Video Codec Based on H.264
H.264 is the current state-of-the-art monoscopic video codec providing almost twice the coding efficiency with the same quality comparing the previous codecs. With the increasing ...
Cagdas Bilen, Anil Aksay, Gozde Bozdagi Akar
ANSS
2006
IEEE
16 years 19 days ago
Grid-Boxing for Spatial Simulation Performance Optimisation
— Computer simulations of complex systems such as physical aggregation processes or swarming and collective behaviour of life-forms, often require order N-squared computational c...
Kenneth A. Hawick, Heath A. James, C. J. Scogings