Sciweavers

248 search results - page 41 / 50
» On the Cayley isomorphism problem
Sort
View
IPPS
2006
IEEE
14 years 3 months ago
Optimal map construction of an unknown torus
In this paper we consider the map construction problem in the case of an anonymous, unoriented torus of unknown size. An agent that can move from node to neighbouring node in the ...
Hanane Becha, Paola Flocchini
LICS
1999
IEEE
14 years 1 months ago
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
Albert Atserias, Phokion G. Kolaitis
EDM
2010
160views Data Mining» more  EDM 2010»
13 years 11 months ago
Using Neural Imaging and Cognitive Modeling to Infer Mental States while Using an Intelligent Tutoring System
Functional magnetic resonance imaging (fMRI) data were collected while students worked with a tutoring system that taught an algebra isomorph. A cognitive model predicted the distr...
Jon M. Fincham, John R. Anderson, Shawn Betts, Jen...
IPCO
2007
108views Optimization» more  IPCO 2007»
13 years 11 months ago
Orbital Branching
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that a...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
13 years 11 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau