Sciweavers

14158 search results - page 2531 / 2832
» Generalized switch-setting problems
Sort
View
ACL
1996
15 years 6 months ago
Linguistic Structure as Composition and Perturbation
This paper discusses the problem of learning language from unprocessed text and speech signals, concentrating on the problem of learning a lexicon. In particular, it argues for a ...
Carl de Marcken
127
Voted
IJCAI
1989
15 years 6 months ago
An Approximate Solver for Symbolic Equations
This paper describes a program, called NEWTON, that finds approximate symbolic solutions to parameterized equations in one variable. N E W T O N derives an initial approximation b...
Elisha Sacks
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
15 years 6 months ago
Separation and Approximation of Polyhedral Objects
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
Joseph S. B. Mitchell, Subhash Suri
APCCM
2009
15 years 6 months ago
Conceptual Application Domain Modelling
Application domain description precedes requirements engineering, and is the basis for the development of a software or information system that satisfies all expectations of its u...
Bernhard Thalheim, Klaus-Dieter Schewe, Hui Ma
ATAL
2009
Springer
15 years 6 months ago
Efficient physics-based planning: sampling search via non-deterministic tactics and skills
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
Stefan Zickler, Manuela M. Veloso
« Prev « First page 2531 / 2832 Last » Next »