Sciweavers

8413 search results - page 150 / 1683
» Ordering Problem Subgoals
Sort
View
STACS
2010
Springer
14 years 5 months ago
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
François Le Gall
CONSTRAINTS
2010
110views more  CONSTRAINTS 2010»
13 years 7 months ago
Solving subgraph isomorphism problems with constraint programming
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Stéphane Zampelli, Yves Deville, Christine ...
ICASSP
2011
IEEE
13 years 2 months ago
A reweighted least squares algorithm for detection of QAM signaling in MIMO channels
This paper proposes a reweighted least squares algorithm for quadrature amplitude modulation (QAM) detector in multiple-input multiple-output (MIMO) channels. Although the QAM det...
Katsumi Konishi, Toshihiro Furukawa
WG
2004
Springer
14 years 3 months ago
Decremental Clique Problem
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
Fabrizio Grandoni, Giuseppe F. Italiano
CP
2001
Springer
14 years 2 months ago
Evaluation of Search Heuristics for Embedded System Scheduling Problems
Abstract. In this paper we consider the problem of optimal task allocation and scheduling in embedded real-time systems. This problem is far from trivial due to the wide range of c...
Cecilia Ekelin, Jan Jonsson