3134 search results - page 24 / 627 » Computing full disjunctions |
MOC
2000
15 years 2 months ago
2000
Abstract. The main problem when solving a Thue equation is the computation of the unit group of a certain number field. In this paper we show that the knowledge of a subgroup of fi...
128
click to vote
IPCO
2008
15 years 3 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
162
click to vote
MIG
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Despite the large success of games grounded on movement-based interactions the current state of full body motion capture technologies still prevents the exploitation of p...
131
Voted
IJIS
2011
14 years 5 months ago
2011
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...
116
Voted
ACSC
2007
IEEE
15 years 8 months ago
2007
IEEE
Full hierarchical dependencies (FHDs) constitute a large class of relational dependencies. A relation exhibits an FHD precisely when it can be decomposed into at least two of its ...