Sciweavers

7988 search results - page 1257 / 1598
» A Useful Undecidable Theory
Sort
View
COCO
2010
Springer
152views Algorithms» more  COCO 2010»
15 years 10 months ago
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
Derrick Stolee, Chris Bourke, N. V. Vinodchandran
CANDT
2009
15 years 10 months ago
Understanding collective content: purposes, characteristics and collaborative practices
User-created media content is being increasingly shared with the communities people belong to. The content has a role of a motivator in social interaction within the communities. ...
Thomas Olsson
PODC
2010
ACM
15 years 10 months ago
Brief announcement: asynchronous bounded expected delay networks
We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is ofte...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
SIGIR
2010
ACM
15 years 10 months ago
Temporal diversity in recommender systems
Collaborative Filtering (CF) algorithms, used to build webbased recommender systems, are often evaluated in terms of how accurately they predict user ratings. However, current eva...
Neal Lathia, Stephen Hailes, Licia Capra, Xavier A...
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
15 years 10 months ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
Philipp Rohlfshagen, John A. Bullinaria
« Prev « First page 1257 / 1598 Last » Next »