Sciweavers

102291 search results - page 20062 / 20459
» Computability in Computational Geometry
Sort
View
APAL
2010
115views more  APAL 2010»
15 years 7 months ago
Kripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
Lev D. Beklemishev
171
Voted
ANOR
2008
69views more  ANOR 2008»
15 years 7 months ago
Scheduling vessels and container-yard operations with conflicting objectives
Abstract We consider the problem of coordinating the operations of two supply chain partners: a foreign shipping company and a domestic port. The two partners have conflicting busi...
Endre Boros, Lei Lei, Yao Zhao, Hua Zhong
AO
2007
119views more  AO 2007»
15 years 7 months ago
The model of roles within an ontology development tool: Hozo
One of the major goals of ontology is to represent properly the underlying conceptual structure of the messy world reflecting the reality as much as possible. Ontology building to...
Riichiro Mizoguchi, Eiichi Sunagawa, Kouji Kozaki,...
AROBOTS
2010
180views more  AROBOTS 2010»
15 years 7 months ago
Reactive direction control for a mobile robot: a locust-like control of escape direction emerges when a bilateral pair of model
Locusts possess a bilateral pair of uniquely identifiable visual neurons that respond vigorously to the image of an approaching object. These neurons are called the lobula giant m...
Shigang Yue, Roger D. Santer, Yoshifumi Yamawaki, ...
APPML
2007
101views more  APPML 2007»
15 years 6 months ago
Extension of a theorem of Whitney
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
Paul C. Kainen, Shannon Overbay
« Prev « First page 20062 / 20459 Last » Next »