Sciweavers

2449 search results - page 279 / 490
» Tensor Embedding Methods
Sort
View
IJCAI
1997
15 years 9 days ago
Let's Plan It Deductively!
The paper describes a transition logic, TL, and a deductive formalism for it. It shows how various important aspects (such as ramification, qualification, specificity, simultaneit...
Wolfgang Bibel
EJC
2010
14 years 11 months ago
Perfect matchings with restricted intersection in cubic graphs
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
Tomás Kaiser, André Raspaud
COR
2006
86views more  COR 2006»
14 years 11 months ago
Heuristics for a bidding problem
In this paper, we study a bidding problem which can be modeled as a set packing problem. A simulated annealing heuristic with three local moves, including an embedded branch-and-b...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu
ENTCS
2006
213views more  ENTCS 2006»
14 years 11 months ago
Building Components from Functions
In the domain of embedded software systems the increasing complexity of the functionality as well as the increase in variations caused by product lines requires a modular design p...
Bernhard Schäz
IJBC
2007
86views more  IJBC 2007»
14 years 11 months ago
Optimization and the Miranda Approach in Detecting Horseshoe-Type Chaos by Computer
f of the underlying abstract theorem avoids of referring to any results of applied algebraic topology and relies only on the Brouwer fixed point theorem. The second novelty is tha...
Balázs Bánhelyi, Tibor Csendes, Barn...