Sciweavers

1559 search results - page 93 / 312
» Some Group Theory Problems
Sort
View
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
15 years 9 months ago
Important moments in systems, control and optimization
— The moment problem matured from its various special forms in the late 19th and early 20th Centuries to a general class of problems that continues to exert profound influence o...
Christopher I. Byrnes, Anders Lindquist
ICCAD
2006
IEEE
139views Hardware» more  ICCAD 2006»
16 years 1 months ago
Analog placement with symmetry and other placement constraints
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
Yiu-Cheong Tam, Evangeline F. Y. Young, Chris C. N...
OPODIS
2004
15 years 5 months ago
Self-optimizing DHTs Using Request Profiling
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
Alina Bejan, Sukumar Ghosh
JETAI
2007
131views more  JETAI 2007»
15 years 4 months ago
A computational architecture for heterogeneous reasoning
Reasoning, problem solving, indeed the general process of acquiring knowledge, is not an isolated, homogenous affair involving a one agent using a single form of representation, b...
Dave Barker-Plummer, John Etchemendy
COMPGEOM
2010
ACM
15 years 9 months ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar