Sciweavers

12289 search results - page 457 / 2458
» computing 2006
Sort
View
ENTCS
2006
88views more  ENTCS 2006»
15 years 6 months ago
On Reversible Combinatory Logic
The -calculus is destructive: its main computational mechanism
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
PR
2002
62views more  PR 2002»
15 years 6 months ago
Using Fourier/Mellin-based correlators and their fractional versions in navigational tasks
The navigational tasks of computing time to impact and controlling movements in speci
Didi Sazbon, Zeev Zalevsky, Ehud Rivlin, David Men...
152
Voted
COMBINATORICS
1999
75views more  COMBINATORICS 1999»
15 years 6 months ago
Stability of Kronecker Products of Irreducible Characters of the Symmetric Group
F. Murnaghan observed a long time ago that the computation of the decompositon of the Kronecker product (n-a,2,... ) (n-b,
Ernesto Vallejo
NETWORKS
2010
15 years 4 months ago
Mixed search number and linear-width of interval and split graphs
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.
Fedor V. Fomin, Pinar Heggernes, Rodica Mihai
ORL
2007
54views more  ORL 2007»
15 years 6 months ago
A new lower bound for the non-oriented two-dimensional bin-packing problem
We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous resul...
François Clautiaux, Antoine Jouglet, Joseph...