default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdward W. Kamen
Person information
- affiliation: Georgia Institute of Technology, Atlanta GA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[j7]Mohamed Babaali, Magnus Egerstedt, Edward W. Kamen:
A direct algebraic approach to observer design under switching measurement equations. IEEE Trans. Autom. Control. 49(11): 2044-2049 (2004)- 2003
- [c10]Leandro G. Barajas, Magnus Egerstedt, Edward W. Kamen, Alex Goldstein:
Process control in a high-noise environment using a limited number of measurements. ACC 2003: 597-602 - [c9]Mohamed Babaali, Magnus Egerstedt, Edward W. Kamen:
An observer for linear systems with randomly-switching measurement equations. ACC 2003: 1879-1884 - [c8]Leandro G. Barajas, Ashish Kansal, Abhinav Saxena
, Magnus Egerstedt, Alex Goldstein, Edward W. Kamen:
Modeling and Control of SMT Manufacturing Lines Using Hybrid Dynamic Systems. HSCC 2003: 66-80 - 2002
- [c7]Jeongseung Moon, Yorai Wardi, Edward W. Kamen:
Optimal release times in single-stage manufacturing systems with finite production inventory. CDC 2002: 2506-2511 - 2001
- [c6]Jeongseung Moon, Yorai Wardi, Edward W. Kamen:
Optimal release times in single-stage manufacturing systems. ETFA (1) 2001: 519-526 - [c5]Payam Torab, Edward W. Kamen:
On approximate renewal models for the superposition of renewal processes. ICC 2001: 2901-2906 - 2000
- [j6]James A. Sills, Edward W. Kamen:
On some classes of nonstationary parametric processes. J. Frankl. Inst. 337(2-3): 217-249 (2000) - [j5]Octavian Stan, Edward W. Kamen:
A local linearized least squares algorithm for training feedforward neural networks. IEEE Trans. Neural Networks Learn. Syst. 11(2): 487-495 (2000)
1990 – 1999
- 1999
- [j4]Michael J. Gazarik, Edward W. Kamen:
Reachability and observability of linear systems over max-plus. Kybernetika 35(1): 2-12 (1999) - [c4]Octavian Stan, Edward W. Kamen:
New block recursive MLP training algorithms using the Levenberg-Marquardt algorithm. IJCNN 1999: 1672-1677 - 1997
- [j3]Zhihua Qu, Edward W. Kamen, John F. Dorsey:
Continuous I/O robust control of SISO time-varying systems. Autom. 33(4): 533-550 (1997) - [c3]Octavian Stan, Edward W. Kamen:
A new local linearized least squares algorithm for training feedforward neural networks. ICNN 1997: 1873-1878 - [c2]Gilles P. Mauroy, Edward W. Kamen:
Multiple target tracking using recurrent neural networks. ICNN 1997: 2076-2079 - 1991
- [j2]Chellury R. Sastry, Edward W. Kamen, Marwan A. Simaan:
An efficient algorithm for tracking the angles of arrival of moving targets. IEEE Trans. Signal Process. 39(1): 242-246 (1991)
1970 – 1979
- 1975
- [j1]Edward W. Kamen:
On an Algebraic Theory of Systems Defined by Convolution Operators. Math. Syst. Theory 9(1): 57-74 (1975) - 1974
- [c1]Edward W. Kamen:
Control of linear continuous-time systems defined over rings of distributions. Category Theory Applied to Computation and Control 1974: 180-185
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
