Sciweavers

640 search results - page 90 / 128
» Knowledge-Based Automation of a Design Method for Concurrent...
Sort
View
ENTCS
2007
96views more  ENTCS 2007»
13 years 8 months ago
Deduction, Strategies, and Rewriting
Automated deduction methods should be specified not procedurally, but declaratively, as inference systems which are proved correct regardless of implementation details. Then, di...
Steven Eker, Narciso Martí-Oliet, Jos&eacut...
DAC
1999
ACM
14 years 9 months ago
An Efficient Lyapunov Equation-Based Approach for Generating Reduced-Order Models of Interconnect
In this paper we present a new algorithm for computing reduced-order models of interconnect which utilizes the dominant controllable subspace of the system. The dominant controlla...
Jing-Rebecca Li, Frank Wang, Jacob White
CDC
2009
IEEE
107views Control Systems» more  CDC 2009»
14 years 1 months ago
Learning approaches to the Witsenhausen counterexample from a view of potential games
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...
Na Li, Jason R. Marden, Jeff S. Shamma
NGITS
1999
Springer
14 years 28 days ago
From Object-Process Diagrams to a Natural Object-Process Language
As the requirements for system analysis and design become more complex, the need for a natural, yet formal way of specifying system analysis findings and design decisions are becom...
Mor Peleg, Dov Dori
CHI
2004
ACM
14 years 9 months ago
Automatic support for web user studies with SCONE and TEA
This paper describes the concepts of TEA, a flexible tool that supports user tests by automating repetitive tasks and collecting data of user inputs and actions. TEA was specifica...
Hartmut Obendorf, Harald Weinreich, Torsten Hass